POJ2431 优先队列

Expedition

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 18609		Accepted: 5396

Description

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. 

Input

* 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

Output

* 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.

Sample Input

4
4 4
5 2
11 5
15 10
25 10

Sample Output

2

Hint

INPUT DETAILS: 

The truck is 25 units away from the town; the truck has 10 units of fuel. Along the road, there are 4 fuel stops at distances 4, 5, 11, and 15 from the town (so these are initially at distances 21, 20, 14, and 10 from the truck). These fuel stops can supply up to 4, 2, 5, and 10 units of fuel, respectively. 

OUTPUT DETAILS: 

Drive 10 units, stop to acquire 10 more units of fuel, drive 4 more units, stop to acquire 5 more units of fuel, then drive to the town.

思路：将每个经过的加油站看作随时能够加油的点，假设从此地到下一个目的地，若油不够了，就从目的地之前的加油点取出最大的那一个加油。使用优先队列进行对加油站的数据管理。

代码如下：

<textarea readonly="readonly" name="code" class="c++"> 
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;


struct stop
{
int x;//距离
int v;//容量 
}s[10010];


bool compare(stop s1,stop s2) 
{
return s1.x<s2.x;
}


int main()
{
int n,L,P;
while(cin>>n) //加油站个数
{
for(int i=0;i<n;i++)
{
cin>>s[i].x>>s[i].v;
}
cin>>L>>P;
for(int i=0;i<n;i++)
{
s[i].x=L-s[i].x; //转化为到起点的距离 
}
s[n].x= L;
s[n].v=s[n++].v=0; //把终点镇子看作一个加油站 
sort(s,s+n,compare);
priority_queue<int,vector<int>,less<int> > Q; //值大的优先
int rest=P; //剩余油量
int pos=0; //上一个所在位置
int ans=0; //加油次数
for(int i=0;i<n;i++)
{
int dis=s[i].x-pos; //到此位置需要走的距离
while(rest-dis<0)
{
if(Q.empty()) //如果没有油可以加 
{
ans=-1;
break;
}
rest+=Q.top();
Q.pop();
ans++;
} 
if(ans==-1) break;
rest=rest-dis;
pos=s[i].x;
Q.push(s[i].v); //记录最新到达的油站信息 
}
cout<<ans<<endl;
} 
}
</textarea>