[USACO1.3]混合牛奶 Mixing Milk

题目大意：

标题 from 洛谷
需要买N个单位的牛奶，有M个农民，每个农民的牛奶数量是固定的，但是他们给出的价格不同
请问最少用多少钱可以买到N个单位的牛奶

解题思路：

贪心
一遍排序选最便宜的

Accepted code:

#include<cstdio>
#include<algorithm> 

using namespace std;

struct Milk {
	int Price, Num;
}a[5005];
int price, sum, N, M;

bool cmp(Milk x, Milk y) {
	return x.Price < y.Price;
}

int main() {
	scanf("%d %d", &N, &M);
	for (int i = 1; i <= M; i++)
		scanf("%d %d", &a[i].Price, &a[i].Num);
	sort(a+1, a+M+1, cmp); int i = 0;
	while (sum < N) {
		++i;
		if (sum + a[i].Num > N) price += (N - sum) * a[i].Price, sum = N;
		else price += a[i].Num * a[i].Price, sum += a[i].Num;
	}
	printf("%lld\n", price);
}