The Merry Milk Makers company buys milk from farmers, packages it into attractive 1- and 2-Unit bottles, and then sells that milk to grocery stores so we can each start our day with delicious cereal and milk.
Since milk packaging is such a difficult business in which to make money, it is important to keep the costs as low as possible. Help Merry Milk Makers purchase the farmers' milk in the cheapest possible manner. The MMM company has an extraordinarily talented marketing department and knows precisely how much milk they need each day to package for their customers.
The company has contracts with several farmers from whom they may purchase milk, and each farmer has a (potentially) different price at which they sell milk to the packing plant. Of course, a herd of cows can only produce so much milk each day, so the farmers already know how much milk they will have available.
Each day, Merry Milk Makers can purchase an integer number of units of milk from each farmer, a number that is always less than or equal to the farmer's limit (and might be the entire production from that farmer, none of the production, or any integer in between).
Given:
calculate the minimum amount of money that Merry Milk Makers must spend to meet their daily need for milk.
Note: The total milk produced per day by the farmers will always be sufficient to meet the demands of the Merry Milk Makers even if the prices are high.
| Line 1: | Two integers, N and M. The first value, N, (0 <= N <= 2,000,000) is the amount of milk that Merry Milk Makers wants per day. The second, M, (0 <= M <= 5,000) is the number of farmers that they may buy from. |
| Lines 2 through M+1: | The next M lines each contain two integers: Pi and Ai. Pi (0 <= Pi <= 1,000) is price in cents that farmer i charges. Ai (0 <= Ai <= 2,000,000) is the amount of milk that farmer i can sell to Merry Milk Makers per day. |
100 5 5 20 9 40 3 10 8 80 6 30
100 5 -- MMM wants 100 units of milk from 5 farmers
5 20 -- Farmer 1 says, "I can sell you 20 units at 5 cents per unit"
9 40 etc.
3 10 -- Farmer 3 says, "I can sell you 10 units at 3 cents per unit"
8 80 etc.
6 30 -- Farmer 5 says, "I can sell you 30 units at 6 cents per unit"
A single line with a single integer that is the minimum cost that Merry Milk Makers must pay for one day's milk.
630
Here's how the MMM company spent only 630 cents to purchase 100 units of milk:
| Price per unit | Units available | Units bought | Price * # units | Total cost | Notes |
|---|---|---|---|---|---|
| 5 | 20 | 20 | 5*20 | 100 | |
| 9 | 40 | 0 | Bought no milk from farmer 2 | ||
| 3 | 10 | 10 | 3*10 | 30 | |
| 8 | 80 | 40 | 8*40 | 320 | Did not buy all 80 units! |
| 6 | 30 | 30 | 6*30 | 180 | |
| Total | 180 | 100 | 630 | Cheapest total cost |
- /*
- ID: choiyin1
- TASK: milk
- LANG: C++
- */
- #include
- using namespace std;
- struct milk{
- int price;
- int unit;
- }a[10000];
- int cmp(milk b,milk c){
- return b.price
- }
- int main(){
- freopen("milk.in","r",stdin);
- freopen("milk.out","w",stdout);
- int unit,farmer;
- cin>>unit>>farmer;
- for(int i=0;i
- cin>>a[i].price>>a[i].unit;
- }
- sort(a,a+farmer,cmp);
- int cnt=0;
- int price=0;
- for(int i=0;i
- if(a[i].unit+cnt
- cnt+=a[i].unit;
- price+=a[i].price*a[i].unit;
- }else{
- price+=a[i].price*(unit-cnt);
- break;
- }
- }
- cout<
- }
-
相关阅读:
解决plt.imshow()不显示图片cv2.imshw()不显示图片
计算机网络概述(接入网和物理媒体)
uboot命令1
Bandizip批量解压遇到的问题
Android 开发调试时连接手机5037端口被占用的问题解决
Linux驱动开发 --- IIC总线
DCMM数据管理能力成熟度等级划分
408 | 408常用计算公式与方法 —— 计组篇 汇总
结合PROFINET和OPC UA的优势监控现代化设备
CSS基础语法
-
原文地址:https://blog.csdn.net/GeekAlice/article/details/126937444