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

         B. Summer sell-off

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 ki products 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.

Examples
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 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.

题意：有n天，给定每一天商店里的货物和来商店的客户人数，每个客户必须买一个，当且仅当货物充足（货物数>=人数）,否则不买。从n天中选择f天，使当天的 货物数*2，求n天内能卖出的最大货物？

思路：
一个很水的贪心，计算出把每一天的货物数都增加2倍后比其不增加时能多卖出的货物数量，按照这个值从大到小排序，然后开始取f次。

contest的时候RE了3发……最后把数组long long 改了int 过了……..

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
struct node{
    int l,r;
    int s1,s2;
    bool operator <(const node &p)const{
    return (s2-s1>(p.s2-p.s1));
    }
};
node a[500005];
int main(){
    int n,f;
    cin>>n>>f;
    for(int i=0;i<n;i++){
        int LL,rr;
        cin>>LL>>rr;
        a[i].l=LL,a[i].r=rr;
        a[i].s1=a[i].l<a[i].r?a[i].l:a[i].r;
        a[i].s2=2*a[i].l<a[i].r?2*a[i].l:a[i].r;
    }
    sort(a,a+n);
    int cns=0;
    for(int i=0;i<n;i++){
        if(cns==f){
            break;
        }
        int l,r;
        l=a[i].l,r=a[i].r;
        if(l>0&&r>l){
            a[i].l=l+l;
            //cout<<i<<endl;
            cns++;

        }
    }
    long long ans=0;
    for(int i=0;i<n;i++){
        ans+=(a[i].l<a[i].r?a[i].l:a[i].r);
    }
    cout<<ans<<endl;

    return 0;
}