Submission #6830717

---

Source Code Expand

  //shan61916
#include <bits/stdc++.h>
  using namespace std;
typedef   long long ll;
typedef   unsigned long long ull ;
typedef   double dll ;

#define   mp make_pair
#define   pb push_back
#define   ff first 
#define   ss second
#define   IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define   endl "\n" 
#define   pll pair<ll, ll>
#define   all(x) x.begin(), x.end()
#define   vll vector<ll> 
unordered_map<ll, ll> parent ;
void makeset(ll x) {
	parent[x] = x;
}
ll findset(ll x) {
	if(x == parent[x]) return x;
	return parent[x] = findset(parent[x]) ;
}
void unioset(ll x, ll y) {

	if(x > y) swap(x, y);
	parent[y] = x;
} 
int main(){
 IOS
#ifdef SHAN
    freopen("input.txt" , "r" , stdin);  
#endif
  ll n, m;
  cin >> n >> m;
  vector<pll> vc ;
  for(ll i = 0; i < n; i++) {
  	ll x, y;
  	cin >> x >> y;
  	if(x <= m) {
  		vc.pb(mp(y, x));
  	}
  }
  for(ll i = 0; i <= m; i++) makeset(i) ;
  sort(all(vc), greater<pll>());
  // vector<ll> visited(m+1, false);
  ll sum = 0;
  for(auto it: vc) {
      ll x = it.first, y = it.second ;
      y = m - y;
      ll tt = findset(y+1) ;
      tt-- ;
      if(tt >=0) {
      	sum+=x;
      	unioset(tt, tt+1) ;
      }
  }
  cout << sum << endl;
  return 0;
} //good night.

Submission Info

Judge Result