CF810B.Summer sell-off

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn days. For each day sales manager knows exactly, that in ii -th day kik_{i} products will be put up for sale and exactly lil_{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 ff days from nn next for sell-outs. On each of ff chosen days the number of products were put up for sale would be doubled. Thus, if on ii -th day shop planned to put up for sale kik_{i} products and Noora has chosen this day for sell-out, shelves of the shop would keep 2ki2·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 ff days to maximize total number of sold products. She asks you to help her with such a difficult problem.

输入格式

The first line contains two integers nn and ff (1<=n<=105,0<=f<=n)(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 nn subsequent lines contains two integers ki,lik_{i},l_{i} (0<=ki,li<=109)(0<=k_{i},l_{i}<=10^{9}) denoting the number of products on the shelves of the shop on the ii -th day and the number of clients that will come to the shop on ii -th day.

输出格式

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

输入输出样例

  • 输入#1

    4 2
    2 1
    3 5
    2 3
    1 5
    

    输出#1

    10
  • 输入#2

    4 1
    0 2
    0 3
    3 5
    0 6
    

    输出#2

    5

说明/提示

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

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

首页