CF 558A(Lala Land and Apple Trees-暴力)
2015-07-15 17:54
435 查看
A. Lala Land and Apple Trees
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is
located in a position xi and
has ai apples
growing on it. Amr wants to collect apples from the apple trees. Amr currently stands in x = 0 position. At the beginning, he can choose
whether to go right or left. He'll continue in his direction until he meets an apple tree he didn't visit before. He'll take all of its apples and then reverse his direction, continue walking in this direction until he meets another apple tree he didn't visit
before and so on. In the other words, Amr reverses his direction when visiting each new apple tree. Amr will stop collecting apples when there are no more trees he didn't visit in the direction he is facing.
What is the maximum number of apples he can collect?
Input
The first line contains one number n (1 ≤ n ≤ 100),
the number of apple trees in Lala Land.
The following n lines contains two integers each xi, ai ( - 105 ≤ xi ≤ 105, xi ≠ 0, 1 ≤ ai ≤ 105),
representing the position of the i-th tree and number of apples on it.
It's guaranteed that there is at most one apple tree at each coordinate. It's guaranteed that no tree grows in point 0.
Output
Output the maximum number of apples Amr can collect.
Sample test(s)
input
output
input
output
input
output
Note
In the first sample test it doesn't matter if Amr chose at first to go left or right. In both cases he'll get all the apples.
In the second sample test the optimal solution is to go left to x = - 1, collect apples from there, then the direction will be reversed,
Amr has to go to x = 1, collect apples from there, then the direction will be reversed and Amr goes to the final tree x = - 2.
In the third sample test the optimal solution is to go right to x = 1, collect apples from there, then the direction will be reversed
and Amr will not be able to collect anymore apples because there are no apple trees to his left.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is
located in a position xi and
has ai apples
growing on it. Amr wants to collect apples from the apple trees. Amr currently stands in x = 0 position. At the beginning, he can choose
whether to go right or left. He'll continue in his direction until he meets an apple tree he didn't visit before. He'll take all of its apples and then reverse his direction, continue walking in this direction until he meets another apple tree he didn't visit
before and so on. In the other words, Amr reverses his direction when visiting each new apple tree. Amr will stop collecting apples when there are no more trees he didn't visit in the direction he is facing.
What is the maximum number of apples he can collect?
Input
The first line contains one number n (1 ≤ n ≤ 100),
the number of apple trees in Lala Land.
The following n lines contains two integers each xi, ai ( - 105 ≤ xi ≤ 105, xi ≠ 0, 1 ≤ ai ≤ 105),
representing the position of the i-th tree and number of apples on it.
It's guaranteed that there is at most one apple tree at each coordinate. It's guaranteed that no tree grows in point 0.
Output
Output the maximum number of apples Amr can collect.
Sample test(s)
input
2 -1 5 1 5
output
10
input
3 -2 2 1 4 -1 3
output
9
input
3 1 9 3 5 7 10
output
9
Note
In the first sample test it doesn't matter if Amr chose at first to go left or right. In both cases he'll get all the apples.
In the second sample test the optimal solution is to go left to x = - 1, collect apples from there, then the direction will be reversed,
Amr has to go to x = 1, collect apples from there, then the direction will be reversed and Amr goes to the final tree x = - 2.
In the third sample test the optimal solution is to go right to x = 1, collect apples from there, then the direction will be reversed
and Amr will not be able to collect anymore apples because there are no apple trees to his left.
#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<functional> #include<iostream> #include<cmath> #include<cctype> #include<ctime> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #define Fork(i,k,n) for(int i=k;i<=n;i++) #define Rep(i,n) for(int i=0;i<n;i++) #define ForD(i,n) for(int i=n;i;i--) #define RepD(i,n) for(int i=n;i>=0;i--) #define Forp(x) for(int p=pre[x];p;p=next[p]) #define Forpiter(x) for(int &p=iter[x];p;p=next[p]) #define Lson (x<<1) #define Rson ((x<<1)+1) #define MEM(a) memset(a,0,sizeof(a)); #define MEMI(a) memset(a,127,sizeof(a)); #define MEMi(a) memset(a,128,sizeof(a)); #define INF (2139062143) #define F (100000007) #define MAXN (1000) typedef long long ll; ll mul(ll a,ll b){return (a*b)%F;} ll add(ll a,ll b){return (a+b)%F;} ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;} void upd(ll &a,ll b){a=(a%F+b%F)%F;} int n; pair<int,int> p[MAXN]; int main() { // freopen("A.in","r",stdin); // freopen(".out","w",stdout); cin>>n; For(i,n) scanf("%d%d",&p[i].first,&p[i].second); sort(p+1,p+1+n); p[0]=p[n+1]=make_pair(-INF,-INF); int p2=1; while(p2<=n&&p[p2].first<0) ++p2; if (p2>n) { cout<<p .second<<endl;return 0; } int s1,s2; int len=min(s1=p2-1,s2=n-p2+1); int ans=0; For(i,len) { ans+=p[p2+i-1].second+p[p2-i].second; } int l=p2-len,r=p2+len-1; if (l==1&&r<n) ans+=p[r+1].second; if (r==n&&l>1) ans+=p[l-1].second; if (l>1&&r<n) ans+=max(p[l-1].second,p[r+1].second); cout<<ans<<endl; return 0; }
相关文章推荐
- 小米手机连不上android studio
- XMPP之ios即时通讯客户端开发-创建工程添加XMPPFramework及其他框架(三)
- html-----vedio标签(HTML5新标签VIDEO在IOS上默认全屏播放)
- 使用八种牛云存储解决方案ios7.1的app部署问题
- android studio官网
- iOS手势识别的详细介绍
- Android会议室管理app
- APP软件半成品测试技巧
- android ziputil
- iOS多线程管理-Thread,NSOperation,GCD的简单用法
- iOS单例
- Android世界第一个activity启动过程
- Android中使用Intent打开本地图库
- Android中用layer-list编写阴影效果
- Quick-Cocos2d-x 3.3中常用的文件和函数(二)
- 【Android Studio】欢乐快捷键大集结
- Android 高手进阶之自定义View,自定义属性(带进度的圆形进度条)
- Quick-Cocos2d-x 3.3中常用的文件和函数(一)
- Android Support Library
- Swift 中的函数(下)