Submission #2527564

---

Source Code Expand

#include<iostream>
#include<queue>
#include<algorithm>
#include<vector>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repr(i,a,b) for(int i=(a);i>=(b);i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
template<typename T> using min_priority_queue = priority_queue<T,vector<T>,greater<T>>;
int N,K;
long long A[101010],B[101010];
int main(){
	cin >> N >> K;
	rep(i,0,N)	cin >> A[i] >> B[i];
	min_priority_queue<pair<long long,int>> q;
	rep(i,0,N)	q.push({A[i],i});
	long long ans = 0;
	rep(i,0,K){
		auto p = q.top();q.pop();
		ans += p.first;
		q.push({p.first+B[p.second],p.second});
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result