Expedition POJ - 2431

题目大意：给定若干个加油站，初始有油，每走一格子耗费一单位油，询问最少加油次数

解题思路：后悔贪心，我们先假定泥头车最远能走多少路，并且把泥头车经过了的加油站能给给予的油量储存起来，在泥头车油不够的时候，遍历之前经过的加油站并且我们选择最优秀策略的油量加到自身中，对于油量维护我们使用一个优先队列即可

#define _CRTSECURE_nOWARnInGS
#pragma warning(disable:4996)
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cassert>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
const int maxn = 1e4 + 10;
pair<ll,ll> p[maxn];
ll num,fuel;
int n;
priority_queue<ll,vector<ll>,less<ll> >q;
int main()
{
	while(!q.empty()) q.pop();
	scanf("%d",&n);
	for(int i = 1;i <= n;++i)
	{
		scanf("%lld %lld",&num,&fuel);
		p[i] = make_pair(num,fuel);
	}
	scanf("%lld %lld",&num,&fuel);
	for(int i = 1;i <= n;++i)
	{
		p[i].first = num - p[i].first;
	}
	sort(p + 1, p + 1 + n);
	ll start = 0;
	p[n + 1] = make_pair(num,0);
	ll sum = 0;
	ll cnt = 0;
	for(int i = 1;i <= n + 1;++i)
	{
		sum += p[i].first - start;
		start = p[i].first;
		while(sum > fuel && !q.empty())
		{
			fuel += q.top();
			q.pop();
			cnt++;
		}
		//cout << sum <<" "<<fuel<<"\n";
		if(sum > fuel)
		{
			printf("-1\n");
			break;
		}
		q.push(p[i].second);
	}
	if(sum <= fuel) printf("%lld\n",cnt);
	return 0;
} 
/*
1
3 2
5 0

4
3 2
5 2
7 2
9 2
11 2
*/