POJ-2431

优先队列的应用，参考书上的思路。。

#include<cstdio>
#include<queue>
#include<algorithm>

using namespace std;

namespace
{
	typedef pair<int, int> P;
	vector<P> V;
	int N, L, p;

	bool cmp(const P &p1, const P &p2)
	{
		return p1.first > p2.first;
	}

	void solve()
	{
		sort(V.begin(), V.end(), cmp);
		priority_queue<int> Q;
		int fuel = p, prev = L, res = 0;
		for (size_t i = 0; i < V.size(); i++)
		{
			int d = prev - V[i].first;
			while (fuel < d)
			{
				if (Q.empty())
				{
					puts("-1");
					return;
				}
				fuel += Q.top();
				Q.pop();
				res++;
			}
			fuel -= d;
			Q.push(V[i].second);
			prev = V[i].first;
		}
		printf("%d\n", res);
	}
}

int main()
{
	while (scanf("%d", &N) != EOF)
	{
		V.clear();
		int a, b;
		while (N--)
		{
			scanf("%d %d", &a, &b);
			V.push_back(P(a, b));
		}
		V.push_back(P(0, 0));
		scanf("%d %d", &L, &p);
		solve();
	}
	return 0;
}