Submission #3782567

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <complex>
#include <algorithm>
#include <climits>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#define A 1000010
#define B 2010
#define ll long long

using namespace std;
typedef pair<ll,ll> node;
priority_queue<int> q;
multiset<node> v;
ll n, L, sum, t, p, ans;

int main() {
	cin >> n >> L;
	while (n--) {
		cin >> t >> p;
		node tt; tt.first = -t; tt.second = p;
		v.insert(tt);
		sum += p;
	}
	for (multiset<node>::iterator it = v.begin(); it != v.end(); it++) {
		q.push(-(*it).second);
		q.push(-(*it).second);
		ans += q.top();
		q.pop();
	}
	cout << ans + sum << endl;
	return 0;
}

Submission Info

Judge Result