Educational Codeforces Round 43 E. Well played!（贪心）

E. Well played!

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Max has got himself into popular CCG "BrainStone". As "BrainStone" is a pretty intellectual game, Max has to solve numerous hard problems during the gameplay. Here is one of them:

Max owns n creatures, i-th of them can be described with two numbers — its health hpi and its damage dmgi. Max also has two types of spells in stock:

1. Doubles health of the creature (hpi := hpi·2);
2. Assigns value of health of the creature to its damage (dmgi := hpi).

Spell of first type can be used no more than a times in total, of the second type — no more than b times in total. Spell can be used on a certain creature multiple times. Spells can be used in arbitrary order. It isn't necessary to use all the spells.

Max is really busy preparing for his final exams, so he asks you to determine what is the maximal total damage of all creatures he can achieve if he uses spells in most optimal way.

Input

The first line contains three integers n, a, b (1 ≤ n ≤ 2·105, 0 ≤ a ≤ 20, 0 ≤ b ≤ 2·105) — the number of creatures, spells of the first type and spells of the second type, respectively.

The i-th of the next n lines contain two number hpi and dmgi (1 ≤ hpi, dmgi ≤ 109) — description of the i-th creature.

Output

Print single integer — maximum total damage creatures can deal.

Examples

input

Copy

2 1 1
10 15
6 1

output

Copy

27

input

Copy

3 0 3
10 8
7 11
5 2

output

Copy

26

Note

In the first example Max should use the spell of the first type on the second creature, then the spell of the second type on the same creature. Then total damage will be equal to 15 + 6·2 = 27.

In the second example Max should use the spell of the second type on the first creature, then the spell of the second type on the third creature. Total damage will be equal to 10 + 11 + 5 = 26.

题意：有n行数字，每行有h[i],d[i]. 

你可以进行两种操作：

a：h[i]=2*h[i]   

b:  d[i]=h[i]. 　　　　两种操作只能分别进行 ：a, b次。

问最后：sum(d[i])(i=1,2..n)的最大值。

思路：遍历一遍，对每个i进行a次操作，讨论最优情况取最大值。

代码：

//#include"bits/stdc++.h"
#include<sstream>
#include<iomanip>
#include"cstdio"
#include"map"
#include"set"
#include"cmath"
#include"queue"
#include"vector"
#include"string"
#include"cstring"
#include"time.h"
#include"iostream"
#include"stdlib.h"
#include"algorithm"
#define db double
#define ll long long
#define vec vectr<ll>
#define mt  vectr<vec>
#define ci(x) scanf("%d",&x)
#define cd(x) scanf("%lf",&x)
#define cl(x) scanf("%lld",&x)
#define pi(x) printf("%d
",x)
#define pd(x) printf("%f
",x)
#define pl(x) printf("%lld
",x)
//#define rep(i, x, y) for(int i=x;i<=y;i++)
#define rep(i, n) for(int i=0;i<n;i++)
const int N   = 1e6+ 5;
const int mod = 1e9 + 7;
const int MOD = mod - 1;
const int inf = 0x3f3f3f3f;
const db  PI  = acos(-1.0);
const db  eps = 1e-10;
using namespace std;
int n;
int A,B;
int  a[N],b[N];
priority_queue<int,vector<int>,greater<int>> q;
int main() {
    ll ans = 0;
    cin >> n >> A >> B;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        if (a[i] > b[i]) q.push(a[i] - b[i]);
    }
    for (int i = 0; i < n; i++) ans += b[i];
    while (q.size() > B) q.pop();
    if (!B) return 0 * pl(ans);
    ll tans = ans;
    for (int i = 0; i < n; i++) {//讨论q长度与B的大小及i所处的位置
        ll x = a[i] * (1LL << A);
        if (q.size() && a[i] - b[i] >= q.top())
            tans = max(tans, ans - (a[i] - b[i]) + x - b[i]);
        else {
            if (q.size() < B)
                tans = max(tans, ans + x - b[i]);
            else
                tans = max(tans, ans - q.top() + x - b[i]);
        }
    }
    while (q.size()) {
        tans += q.top();
        q.pop();
    }
    pl(tans);
}