Submission #6811836

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int main(){
  vector < pair < int, int > > v;
  int n, m;
  cin >> n >> m;
  for(int i = 0 ; i < n ;  i++){
    int x, y;
    cin >> x >> y;
    v.push_back({y, x});
  }
  sort(v.rbegin(),v.rend());
  set < int > st;
  for(int i = 1 ; i <= m ; i++)
    st.insert(i);
  long long ans = 0;
  for(int i = 0; i < v.size() ; i++){
    auto it = st.lower_bound(v[i].second);
    if (it != st.end()){
      st.erase(it);
      ans += v[i].first;
    }
  }
  cout << ans;
  return 0;
}

Submission Info

Judge Result