POJ--2431--Expedition

题目描述：
A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck’s fuel tank. The truck now leaks one unit of fuel every unit of distance it travels.
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this road, between the town and the current location of the truck, there are N (1 <= N <= 10,000) fuel stops where the cows can stop to acquire additional fuel (1…100 units at each stop).
The jungle is a dangerous place for humans and is especially dangerous for cows. Therefore, the cows want to make the minimum possible number of stops for fuel on the way to the town. Fortunately, the capacity of the fuel tank on their truck is so large that there is effectively no limit to the amount of fuel it can hold. The truck is currently L units away from the town and has P units of fuel (1 <= P <= 1,000,000).
Determine the minimum number of stops needed to reach the town, or if the cows cannot reach the town at all.
输入描述:
Line 1: A single integer, N
Lines 2…N+1: Each line contains two space-separated integers describing a fuel stop: The first integer is the distance from the town to the stop; the second is the amount of fuel available at that stop.
Line N+2: Two space-separated integers, L and P
输出描述:
Line 1: A single integer giving the minimum number of fuel stops necessary to reach the town. If it is not possible to reach the town, output -1.
输入：
4
4 4
5 2
11 5
15 10
25 10
输出：
2
题意：
一辆卡车，初始时，距离终点L，油量为P，在起点到终点途中有n个加油站，每个加油站油量有限，而卡车的油箱容量无限，卡车在行车途中，每走一个单位的距离消耗一个单位的油量，给定n个加油站距离终点的距离以及油存储量。问卡车是否能到达终点，如果可达，最少需要加多少次油，否则输出-1.
题解：
先将加油站到终点的距离由远到近排下序，这样离起点就是由近到远。就是每经过一个加油站就将该加油站的油量压入优先队列中，然后每次没油的时候，去队首元素加油即可。
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;

const int maxn = 10000 + 5;
struct point{
    int dis,f;
};

int cmp(point x,point y){
    return x.dis > y.dis;
}

point a[maxn];

int main(){
    int n;
    int l,p;
    while(scanf("%d",&n)!=EOF){
        for(int i = 0; i < n; i ++){
            scanf("%d%d",&a[i].dis,&a[i].f);
        }
        sort(a,a + n,cmp);
        scanf("%d%d",&l,&p);
        priority_queue<int> pq;
        pq.push(p);
        int ans = 0;
        int t = 0;
        while(l > 0 && !pq.empty()){
            ans ++;
            l -= pq.top();
            pq.pop();
            while(a[t].dis >= l && t < n){
                pq.push(a[t].f);
                t ++;
            }
        }
        if(l > 0) printf("-1\n");
        else printf("%d\n",ans - 1);
    }
    return 0;
}