Stones (2013.09.15周赛)
来源:互联网 发布:淘宝客服在家上班 编辑:程序博客网 时间:2024/06/07 10:47
D. Stones
3000ms
3000ms
32768KB
64-bit integer IO format: %I64d Java class name: Main
Font Size:
Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
Input
In the first line, there is an Integer T(1<=T<=10), which means the test cases in the input file. Then followed by T test cases.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
Output
Just output one line for one test case, as described in the Description.
Sample Input
221 52 421 56 6
Sample Output
1112
这道题其实就是优先队列的运用。要注意一下优先队列的使用。
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<queue>using namespace std;struct node{ int p,d; friend bool operator <(node s, node v) { if (s.p!=v.p) return s.p>v.p; return s.d>v.d; }};int main (){ int t,n,i,j; cin>>t; while(t--) { cin>>n; node e; priority_queue<node> q; for (i=0; i<n; i++) { scanf("%d%d",&e.p,&e.d); q.push(e); } int k=1,max=0; while(!q.empty()) { e=q.top(); q.pop(); if (k%2) { e.p=e.d+e.p; if (e.p>max) max=e.p; q.push(e); } k++; } cout<<max<<endl; } return 0;}
- Stones (2013.09.15周赛)
- Stones(优先队列)
- Stones(优先队列)
- Stones
- Stones
- Stones
- Stones
- Stones
- Stones(hdu1896)优先队列
- 1896 Stones(优先队列)
- HDOJ Stones (优先队列)
- hd1896 Stones(队列优先)
- HDU Stones(优先队列)
- 石子游戏(Play with Stones)
- A - Stones on the Table (hdu)
- HDU 1896 -- Stones (优先队列)
- 杭电1896 Stones(优先队列)
- hdu1896 Stones(优先队列水)
- Map 总结
- 美团网2014校园招聘笔试题(长沙站)
- 集合1
- String和Integer回顾。
- pat1064
- Stones (2013.09.15周赛)
- 美团网2014校招笔试题及解答(长沙站+哈尔滨站)
- 递归和IO
- 百度2014校园招聘笔试题(成都站,软件研发岗)——2013.09.21
- IO2
- 为JSP自定义你自己的标签吧
- 冒泡排序
- IO3
- 2013年九月暴风影音校招笔试题