Submission #1549831

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<LL,LL> PII;

int main() {
	int N,L;
	cin >> N >> L;

	vector<PII> input;
	LL sum = 0;
	for(int i=0; i<N; i++) {
		LL t,p;
		cin >> t >> p;
		input.push_back(PII(t,p));
		sum += p;
	}

	sort(input.begin(), input.end(),  
		[](const PII& x, const PII& y) { return PII(-x.first, x.second) < PII(-y.first, y.second);} );

  
	priority_queue<int, vector<int>, greater<int> > qu;
	LL ans = 0;
	for(int i=0; i<input.size(); i++) {
		qu.push(input[i].second);
		qu.push(input[i].second);
		ans += qu.top();
		qu.pop();
	}
	cout << sum - ans << endl;
	return 0;
}

Submission Info

Judge Result