Codeforces Round #415 (Div. 2) B. Summer sell-off

B. Summer sell-off

time limit per test  

1 second

memory limit per test  

256 megabytes

 

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 kiproducts will be put up for sale and exactly li 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 ki products and Noora has chosen this day for sell-out, shelves of the shop would keep 2·ki 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 ≤ 105, 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 ki, li (0 ≤ ki, li ≤ 109) 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.

 

input

4 2
2 1
3 5
2 3
1 5

output

10

input

4 1
0 2
0 3
3 5
0 6

output

5

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 total1 + 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.

题目大意：

　　　　　有一个超市，现已知接下来n天每天的存货量和需求量，其中可以选f天使得当天的存货量翻倍，问这n天的最大销售量可以是多少?

解题思路：

　　　　　这题可以分两种情况：

　　　　　1  当天的存货量大于等于需求量的时候，这一天的存货量是不需要翻倍的

　　　　　2  当天存货量小于需求量的时候，先让这一天的存货量翻倍，求出当天 ”可增加“ 的销售量

　　　　　然后根据可增加的销售量从大到小排序，选出前f天。

AC代码：

 #include <stdio.h>
 #include <string.h>
 #include <math.h>
 #include <stdlib.h>
 #include <iostream>
 #include <algorithm>

 using namespace std;

 struct P{
     __int64 x; // 存货量
     __int64 y; // 需求量
     __int64 z; // “可增加”的销售量
 }p[];
 bool cmp(P a,P b)
 {
     return a.z > b.z;
 }
 int main ()
 {
     int n,f,i,j;
     __int64 a,b;
     while (~scanf("%d %d",&n,&f))
     {
         int k = ;
         __int64  counts = ;   // 销售量
         for (i = ; i < n; i ++)
         {
             cin>>a>>b;
             if (a >= b)     // 当天的存货量大于等于需求量
                 counts += b;   // 直接加上当天的最大销售额即可
             else     // 当天存货量小于需求量
             {
                 p[k].x = a;
                 p[k].y = b;
                 if (a* <= b)
                     p[k ++].z = a;
                 else
                     p[k ++].z = b-a;
             }
         }
         sort(p,p+k,cmp);
         for (i = ; i < k; i ++)
         {
             if (i < f)    // 选出前f个
                 counts += (p[i].x+p[i].z);
             else
                 counts += p[i].x;
         }
         cout<<counts<<endl;
     }
     return ;
 }