Lala Land and Apple Trees

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?InputThe 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.OutputOutput the maximum number of apples Amr can collect.

Examples

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.

题意分析

有一排树，给出树的坐标和果实数量，刚开始在（0,0)处，可以选择向左走或者向右走，左边或右边没有树了就不能走了。每次经过一棵树可以带走树上的果实，求最多可以带走多少果实

解决方案

首先把果实数量按照坐标放到两个数组里，两个数组分别是（0，0）左边的树和右边的树。
如果两个数组的大小不超过1，说明可以拿到所有的果实，如果超过1，可以拿到数量较小的这边的所有果实和数量较多的这边比他多1棵树的果实，要注意的是如果左边比较多的话，相加应该从右往左加。

错误点

获取两个数组的时候，判断条件应该是坐标是不是小于零，而不是判断i！

AC代码

#include<bits/stdc++.h>
using namespace std;
const int maxn=110;

int n;
int le[maxn];
int ri[maxn];
int te[maxn];

struct node{
	int idx;
	int val;
}a[maxn];

bool cmp(node a,node b){
	return a.idx<b.idx;
}

int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i].idx>>a[i].val;
	}
	//获取两个数组 
	sort(a,a+n,cmp);
	int idl=0,idr=0;
	for(int i=0;i<n;i++){
		if(a[i].idx<0){
			le[idl++]=a[i].val;
		}else
			ri[idr++]=a[i].val;
	}
	
//	cout<<"le"<<endl;
//	for(int i=0;i<idl;i++){
//		cout<<le[i]<<" ";
//	}
//	cout<<endl;
//	cout<<"ri"<<endl;
//	for(int i=0;i<idr;i++){
//		cout<<ri[i]<<" ";
//	}
//	cout<<endl;
	
	
	//两个数组的和 
	int suml=0,sumr=0;
	for(int i=0;i<idl;i++){
		suml+=le[i];
	}
	for(int i=0;i<idr;i++){
		sumr+=ri[i];
	}
	
	int ans;
	int x=abs(idl-idr);
	if(x<=1)
		ans=suml+sumr;
	else{
		if(idl<idr){
			ans=suml;
			for(int i=0;i<=idl;i++){
				ans+=ri[i];
			}
		}else{
//			cout<<"jing"<<endl; 
			ans=sumr;
			for(int i=idl-1;i>=idl-idr-1;i--){
				ans+=le[i];
			}
		}
	}
		
	cout<<ans;
	return 0;
} ```