Source HDU 2008-4 Programming Contest
Stones
Tips
1. 给出石头信息求最后一个石头距离,采用优先队列
#include<cstdio>
#include<iostream>
#include<queue>
#define read() freopen("input.txt","r",stdin)
#define write() freopen("output.txt","w",stdout)
using namespace std;
struct E{
int pos,dis;
bool operator < (const E& a)const{
if(a.pos!=pos) return a.pos<pos;
else return a.dis<dis;
}
}temp;
priority_queue<E>q;
int main(){
read();//write();
int t;cin>>t;
for( int i=0; i<t; i++ ){
int n,flag=1;cin>>n;
while(!q.empty()) q.pop();
for( int i=0; i<n; i++ ){
cin>>temp.pos>>temp.dis;q.push(temp);
}
E temp1;
while(!q.empty()){
temp1=q.top();q.pop();
if(flag&1){
E temp2;temp2.pos=temp1.pos+temp1.dis;temp2.dis=temp1.dis;
q.push(temp2);
}
++flag;
}
printf("%d\n",temp1.pos);
}
return 0;
}