HDU
来源:互联网 发布:ubuntu 查看机器配置 编辑:程序博客网 时间:2024/06/01 22:24
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3109 Accepted Submission(s): 2025
Problem Description
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 <queue>#include <cstdio>using namespace std;struct stone{int d;int w;bool operator <(const stone &a)const{if(a.d==d)return a.w<w;return a.d<d;}}z;int main(){int t;scanf("%d",&t);while(t--){priority_queue<stone>q;int n;scanf("%d",&n);while(n--){scanf("%d %d",&z.d,&z.w);q.push(z);}int i=1;while(i){if(i%2==1){z=q.top();q.pop();z.d+=z.w;q.push(z);if(q.size()==1){printf("%d\n",q.top().d);break;} }else {q.pop();}i++;}}return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- Vue + ElementUI 手撸后台管理网站基本框架(零)前言篇
- Rup(Rationl Unifide Process)
- **[netty内存管理]netty
- 移动端布局
- windbg-!address、!vadump、!vprot(读取内存状态)
- HDU
- 字体垂直居中的几种实现方法
- 博客地址已转移至http://blog.itttl.com
- 用shell脚本实现监控程序自动重启
- dfs
- Vue + ElementUI 手撸后台管理网站基本框架(一)创建项目
- Toast弹出信息
- 减少 per-cpu kthreads引发的系统抖动
- 大端和小端