Codeforces Round 727 (Div. 2)
D
PriceFixed
Codeforces
1600
原题
← CE →
翻译中…

Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store  — "PriceFixed". Here are some rules of that store:

翻译中…
  • The store has an infinite number of items of every product.
  • All products have the same price: $2$ rubles per item.
  • For every product $i$ there is a discount for experienced buyers: if you buy $b_i$ items of products (of any type, not necessarily type $i$), then for all future purchases of the $i$-th product there is a $50\%$ discount (so you can buy an item of the $i$-th product for $1$ ruble!).
翻译中…

Lena needs to buy $n$ products: she must purchase at least $a_i$ items of the $i$-th product. Help Lena to calculate the minimum amount of money she needs to spend if she optimally chooses the order of purchasing. Note that if she wants, she can buy more items of some product than needed.

翻译中…

Input

翻译中…

The first line contains a single integer $n$ ($1 \leq n \leq 100\,000$) — the number of products.

翻译中…

Each of next $n$ lines contains a product description. Each description consists of two integers $a_i$ and $b_i$ ($1 \leq a_i \leq 10^{14}$, $1 \leq b_i \leq 10^{14}$) — the required number of the $i$-th product and how many products you need to buy to get the discount on the $i$-th product.

翻译中…

The sum of all $a_i$ does not exceed $10^{14}$.

翻译中…

Output

翻译中…

Output the minimum sum that Lena needs to make all purchases.

翻译中…

Note

翻译中…

In the first example, Lena can purchase the products in the following way:

翻译中…
  1. one item of product $3$ for $2$ rubles,
  2. one item of product $1$ for $2$ rubles,
  3. one item of product $1$ for $2$ rubles,
  4. one item of product $2$ for $1$ ruble (she can use the discount because $3$ items are already purchased),
  5. one item of product $1$ for $1$ ruble (she can use the discount because $4$ items are already purchased).
翻译中…

In total, she spends $8$ rubles. It can be proved that it is impossible to spend less.

翻译中…

In the second example Lena can purchase the products in the following way:

翻译中…
  1. one item of product $1$ for $2$ rubles,
  2. two items of product $2$ for $2$ rubles for each,
  3. one item of product $5$ for $2$ rubles,
  4. one item of product $3$ for $1$ ruble,
  5. two items of product $4$ for $1$ ruble for each,
  6. one item of product $1$ for $1$ ruble.
翻译中…

In total, she spends $12$ rubles.

翻译中…

样例

Input #1
3
3 4
1 3
1 5
Output #1
8
InputCopy OutputCopy
Input #2
5
2 7
2 8
1 2
2 4
1 8
Output #2
12
InputCopy OutputCopy
题目信息
题号
1539D
时间限制
1 s
内存限制
256 MB
标签
二分
贪心
模拟
排序
双指针

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