POJ2431

题目的意思就是最少加几次油可以到达终点，不行就打印-1.

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<set>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX=10001;
struct ARR{
    int d,f;
}arr[MAX];
int comp(ARR a,ARR b)
{
    return a.d>b.d;
}
int main()
{
  int n;
  priority_queue<int> Q;//默认是从大到小排列的，Q.top()是最大的那个。
  while(~scanf("%d",&n))
  {
  for(int i=0;i<n;i++)
    scanf("%d%d",&arr[i].d,&arr[i].f);
  ARR now;
  scanf("%d%d",&now.d,&now.f);
  sort(arr,arr+n,comp);
  Q.push(now.f);
  int t=0,r=0;
  while(now.d>0&&!Q.empty())
  {
    t++;
    now.d-=Q.top();
    Q.pop();
    while(r<n&&now.d<=arr[r].d)
    {
        Q.push(arr[r++].f);
    }
  }
  if(now.d<=0)
    printf("%d\n",t-1);
   else 
    printf("-1\n");
}
  return 0;
}