Codeforces Round 415 (Div. 2)
B
Summer sell-off
Codeforces
1300
原题
← AC →
翻译中…

Summer holidays! Someone is going on trips, someone is visiting grandparents, but someone is trying to get a part-time job. This summer Noora decided that she wants to earn some money, and took a job in a shop as an assistant.

翻译中…

Shop, where Noora is working, has a plan on the following $*n*$ days. For each day sales manager knows exactly, that in $*i*$-th day $*k*_{*i*}$ products will be put up for sale and exactly $*l*_{*i*}$ clients will come to the shop that day. Also, the manager is sure, that everyone, who comes to the shop, buys exactly one product or, if there aren't any left, leaves the shop without buying anything. Moreover, due to the short shelf-life of the products, manager established the following rule: if some part of the products left on the shelves at the end of the day, that products aren't kept on the next day and are sent to the dump.

翻译中…

For advertising purposes manager offered to start a sell-out in the shop. He asked Noora to choose any $*f*$ days from $*n*$ next for sell-outs. On each of $*f*$ chosen days the number of products were put up for sale would be doubled. Thus, if on $*i*$-th day shop planned to put up for sale $*k*_{*i*}$ products and Noora has chosen this day for sell-out, shelves of the shop would keep $2·*k*_{*i*}$ products. Consequently, there is an opportunity to sell two times more products on days of sell-out.

翻译中…

Noora's task is to choose $*f*$ days to maximize total number of sold products. She asks you to help her with such a difficult problem.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*f*$ $(1 ≤ *n* ≤ 10^{5}, 0 ≤ *f* ≤ *n*)$ denoting the number of days in shop's plan and the number of days that Noora has to choose for sell-out.

翻译中…

Each line of the following $*n*$ subsequent lines contains two integers $*k*_{*i*}, *l*_{*i*}$ $(0 ≤ *k*_{*i*}, *l*_{*i*} ≤ 10^{9})$ denoting the number of products on the shelves of the shop on the $*i*$-th day and the number of clients that will come to the shop on $*i*$-th day.

翻译中…

Output

翻译中…

Print a single integer denoting the maximal number of products that shop can sell.

翻译中…

Note

翻译中…

In the first example we can choose days with numbers $2$ and $4$ for sell-out. In this case new numbers of products for sale would be equal to $[2, 6, 2, 2]$ respectively. So on the first day shop will sell $1$ product, on the second — $5$, on the third — $2$, on the fourth — $2$. In total $1 + 5 + 2 + 2 = 10$ product units.

翻译中…

In the second example it is possible to sell $5$ products, if you choose third day for sell-out.

翻译中…

样例

Input #1
4 2
2 1
3 5
2 3
1 5
Output #1
10
InputCopy OutputCopy
Input #2
4 1
0 2
0 3
3 5
0 6
Output #2
5
InputCopy OutputCopy
题目信息
题号
810B
时间限制
1 s
内存限制
256 MB
标签
贪心
排序

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