题目链接
如果只有一个人买票的话,那么收益为;
如果两个人买票的话,那么总收益为;
以此类推,如果有x个人买票的话,总收益为;
那么,第x个人买票的额外收益额为
这道题的K比较的小,只有1e5,所以我们可以用堆维护这个的最大值,表示第x人去买票,当然,如果收益额小于等于0了,就没必要卖票了。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define Big_INF 0x3f3f3f3f3f3f3f3f
#define eps 1e-6
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
int N, K;
struct node
{
ll val, a, b;
node(ll _v=0, ll _a=0, ll _b=0):val(_v), a(_a), b(_b) {}
friend bool operator < (node e1, node e2) { return e1.val < e2.val; }
} now;
priority_queue<node> Q;
int main()
{
scanf("%d%d", &N, &K);
for(int i=1, a, b; i<=N; i++)
{
scanf("%d%d", &a, &b);
Q.push(node(a - b, a, b));
}
ll ans = 0;
while((K--) && Q.top().val > 0)
{
now = Q.top(); Q.pop();
ans += now.val;
Q.push(node(now.val - 2LL * now.b, now.a, now.b));
}
printf("%lld\n", ans);
return 0;
}