洛谷P1208 [USACO1.3]混合牛奶 Mixing Milk进阶解法

#include<iostream>
#include<algorithm>

using namespace std;
int const MAX_LENGTH = 5000;
int n, m, sum;
struct SFarmer
{
	int p, a;
}farmer[MAX_LENGTH];

bool compare(const SFarmer& first,const SFarmer& second)
{
	return first.p < second.p;
}

int main()
{
	cin >> n >> m;
	for (int i = 0; i < m; i++)
		cin >> farmer[i].p >> farmer[i].a;
	sort(farmer, farmer + m, compare);
	for (int i = 0; i < m; i++)
		if (n >= farmer[i].a)
		{
			sum += farmer[i].a * farmer[i].p;
			n -= farmer[i].a;
		}
		else
		{
			sum += n * farmer[i].p;
			break;
		}
	cout << sum;
	return 0;
}