Submission #6815163

---

Source Code Expand

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;

const int INF = 1e9 + 7;

pi a[100005];

int main()
{
	IO_OP;
	
	int n, m;
	cin >> n >> m;
	for(int i=0;i<n;i++)
		cin >> a[i].S >> a[i].F;
	sort(a, a+n, greater<pi>());
	set<int> s;
	for(int i=0;i<=m;i++)
		s.insert(i);
	int ans = 0;
	for(int i=0;i<n;i++) {
		int l = m - a[i].S;
		if(s.upper_bound(l) == s.begin()) continue;
		int t = *prev(s.upper_bound(l));
		s.erase(t);
		ans += a[i].F;
	}
	cout << ans << endl;

}

Submission Info

Judge Result