Submission #6826566

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long 

signed main()
{
    int n,m;
    cin >> n >> m;

    vector<pair<int,int>> a(n);
    for(int i = 0; i < n; ++i)
    {
        cin >> a[i].first >> a[i].second;
    }
    sort(a.begin(),a.end());
    
    int ans = 0;
    
    auto it = a.begin();
    priority_queue<int> pq;

    for(int i = 1; i <= m; ++i)
    {
        while(it != a.end() && it->first <= i)
        {
            pq.push(it->second);
            ++it;
        }
        if(!pq.empty())
        {
            ans += pq.top();
            pq.pop();
        }
    }
    cout << ans;
}

Submission Info

Judge Result