Submission #6812607

---

Source Code Expand

#include <vector>
#include <sstream>
#include <algorithm>
#include <fstream>
#include <list>
#include <map>
#include <istream>
#include <bitset>
#include <sstream>
#include <unordered_map>
#include <stack>
#include <set>
#include <cmath>
#include <random>
#include <iostream>
#include <bitset>
#include <iomanip>
#include <queue>
#include <string>

#define int long long
#define endl "\n"
#define all(x) x.begin(),x.end()
#define rr return 0
#define xx first
#define yy second
#define pii pair<int,int>

using namespace std;

typedef long long ll;
typedef long double ld;

bool cmp(pii a, pii b){
    if(a.yy == b.yy){
        return a.xx > b.xx;
    }
    return a.yy > b.yy;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    m++;
    vector<pii> a(n);
    for(int i = 0;i < n;i++){
        cin >> a[i].xx >> a[i].yy;
    }
    sort(all(a), cmp);
    int d = 1;
    int ans = 0;
    for(int i = 0;i < n;i++){
        if((a[i].xx + d) <= m){
            ans += a[i].yy;
            d++;
        }
    }
    cout << ans;
    rr;
}

Submission Info

Test Cases