Mixing Milk
来源:互联网 发布:java软件设计师培训 编辑:程序博客网 时间:2024/06/04 23:30
Mixing Milk
Since milk packaging is such a low margin business, it is important to keep the price of the raw product (milk) as low as possible. Help Merry Milk Makers get the milk they need in the cheapest possible manner.
The Merry Milk Makers company has several farmers from which they may buy milk, and each one has a (potentially) different price at which they sell to the milk packing plant. Moreover, as a cow can only produce so much milk a day, the farmers only have so much milk to sell per day. Each day, Merry Milk Makers can purchase an integral amount of milk from each farmer, less than or equal to the farmer's limit.
Given the Merry Milk Makers' daily requirement of milk, along with the cost per gallon and amount of available milk for each farmer, calculate the minimum amount of money that it takes to fulfill the Merry Milk Makers' requirements.
Note: The total milk produced per day by the farmers will be sufficient to meet the demands of the Merry Milk Makers.
InputThe first line contains two integers, N and M. The first value, N, (0 <= N <= 2,000,000) is the amount of milk that Merry Milk Makers' want per day. The second, M, (0 <= M <= 5,000) is the number of farmers that they may buy from.
The next M lines (Line 2 through M+1) 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.
OutputA single line with a single integer that is the minimum price that Merry Milk Makers can get their milk at for one day.
Sample Input100 55 209 403 108 806 30Sample Output
630
#include<stdlib.h>
#include<math.h>
#include<iostream>
using namespace std;
int main()
{
int m,n;
int sum,mon;
sum = mon =0;
int p[5001],a[5001];
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++)
{
scanf("%d %d",&p[i],&a[i]);
}
int temp=0;
for(int i=1;i<m;i++)
{
for(int j=m-1;j>=i;j--)
{
if(p[j]<p[j-1])
{
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
temp=p[j];
p[j]=p[j-1];
p[j-1]=temp;
}
}
}
for(int i=0;i<m;i++)
{
if(sum+a[i]<n)
{
sum=sum+a[i];
mon=mon+a[i]*p[i];
}
else if(sum+a[i]>=n)
{
mon=mon+(n-sum)*p[i];
break;
}
else;
}
printf("%d\n",mon);
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- Mixing Milk
- milk mixing
- USACO 1.3 Mixing Milk (milk)
- USACO1.3.1 Mixing Milk (milk)
- USACO1.3.1 Mixing Milk (milk)
- Problem 76 Mixing Milk
- 我来'Mixing Milk'
- Mixing Milk(USACO)
- Java基础-利用反射获取类信息
- hive几种排序
- JUnit 测试类
- 线程一
- Android中设置控件显示在屏幕底部
- Mixing Milk
- 中软!第四天
- 大文件拆分为小文件进行上传 java
- Android事件分发机制
- java_HSSFWorkbook导出Excel(已解决合并单元格显示部分边框问题)
- 写在2017年的一月
- Linux环境变量
- 如何求一棵二叉树的深度
- linux中使用tail -f查看日志出现中文乱码的解决方案