P1208 [USACO1.3]混合牛奶 Mixing Milk

贪心水题,先从价格少的买即可.

附ac代码:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2000005;

struct node
{
	ll price;
	ll max_sell;
}p[maxn];
bool compare(node a, node b)
{
	if (a.price != b.price) 
		return a.price <  b.price;
}

int main(int argc, char const *argv[])
{
	ll n, m;
	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		cin >> p[i].price >> p[i].max_sell;
	}

	sort(p, p + m, compare);
	ll sum = 0, value = 0;
	for (int i = 0; i < m; ++i)
	{
		if (sum + p[i].max_sell > n)
		{
			value += (n - sum) * p[i].price;
			break;
		}
		else
		{
			sum += p[i].max_sell;
			value += p[i].max_sell * p[i].price;
		}
	}

	cout << value << endl; 
	return 0;
}