Codeforces Round 312 (Div. 2)
A
Lala Land and Apple Trees
Codeforces
1100
原题
←B →
翻译中…

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 $*x*_{*i*}$ and has $*a*_{*i*}$ 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 $*x*_{*i*}$, $*a*_{*i*}$ ($- 10^{5} ≤ *x*_{*i*} ≤ 10^{5}$, $*x*_{*i*} ≠ 0$, $1 ≤ *a*_{*i*} ≤ 10^{5}$), 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.

翻译中…

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.

翻译中…

样例

Input #1
2
-1 5
1 5
Output #1
10
InputCopy OutputCopy
Input #2
3
-2 2
1 4
-1 3
Output #2
9
InputCopy OutputCopy
Input #3
3
1 9
3 5
7 10
Output #3
9
InputCopy OutputCopy
题目信息
题号
558A
时间限制
1 s
内存限制
256 MB
标签
暴力
模拟
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。