AtCoder Beginner Contest 137 D - Summer Vacation——————贪心，优先队列

abc137_D - Summer Vacation

Problem Statement
There are $N$ one-off jobs available. If you take the i-th job and complete it, you will earn the reward of $B_i$ after $A_i$ days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than $M$ days from today.
You can already start working today.

Constraints
All values in input are integers.

• $1\le N\le 10^5$
• $1\le M\le 10^5$
• $1\le A_i\le 10^5$
• $1\le B_i\le 10^4$

Input
Input is given from Standard Input in the following format:

$N$ $M$
$A_1$ $B_1$
$A_2$ $B_2$
$⋮$
$A_N$ $B_N$

Output
Print the maximum total reward that you can earn no later than $M$ days from today.

Sample Input 1
3 4
4 3
4 1
2 2
Sample Output 1
5
You can earn the total reward of $5$ by taking the jobs as follows:

• Take and complete the first job today. You will earn the reward of $3$ after four days from today.
• Take and complete the third job tomorrow. You will earn the reward of $2$ after two days from tomorrow, that is, after three days from today.

Sample Input 2
5 3
1 2
1 3
1 4
2 1
2 3
Sample Output 2
10
Sample Input 3
1 1
2 1
Sample Output 3
0

---

每天只能领取一个工作，不过每天可以做的工作可以有多个
比如样例$1$，第一天领取$43$，在第四天可以得到3的奖励，第二天领取$22$，第三天可以获得2的奖励

我们可以知道，在第$i$天，不能领取工作时长超过$m-i+1$的工作，于是我们就可以在这些满足条件的工作中选择奖励最高的。
倒着想就行了，在倒数第$i$天，我能选择的工作是：工作时长不超过$i$的，在这些满足条件的工作中选择奖励最高的。
用个优先队列维护一下，不过得先排序，按照天数递增排序

贪心，思维，优先队列

#include
using namespace std;
const int MAXN = 1e5+7;
typedef long long ll;

struct node{
        ll a,b;
}z[MAXN];

bool cmp(node x,node y) {
        return x.a<y.a;
}

int main() {
        int n,m;
        while(cin>>n>>m) {
                for(int i=0;i<n;++i)
                        cin>>z[i].a>>z[i].b;
                sort(z,z+n,cmp);
                ll ans = 0;
                int id = 0;
                priority_queue<ll> que;
                for(int i=1;i<=m;++i) {
                        while(z[id].a<=i && id<n) {
                                que.push(z[id].b);
                                id++;
                        }
                        if(que.empty()) continue;
                        ans += que.top();
                        que.pop();
                }
                cout<<ans<<endl;
        }
        return 0;
}