Submission #2546742

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
typedef pair<ll,ll> P;
int INF = 1LL << 30;
int MOD = 1e9+7;
main(){
    int N,K;
    cin >> N >> K;
    vector<int> A(N),B(N);
    priority_queue< P , vector< P > , greater< P > > que;
    for(int i = 0;i < N;i++){
        cin >> A[i] >> B[i];
        que.push(make_pair(A[i],B[i]));
    }
    ll sum = 0;
    for(int i = 0;i < K;i++){
        auto p = que.top();
        que.pop();
        sum += p.first;
        p.first += p.second;
        que.push(p);
    }
    cout << sum << endl;
}

Submission Info

Judge Result