给出n个任务的执行时间 qi q i ,截止时间 di d i ,在互不交叉的情况下最多能完成几个任务
题解:想复杂了,题目中暗示按d排序,优先队列每次抛出完成时间最长的就可以了
(我当时想着万一抛出两个怎么办,后来想如果队列中较大的q都可以放进去,并且现在的q还小,那么此时的q一定只会使队列中抛出一个就可以放进去了,太弱智了自己)
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#define LL long long
const LL INF = 0x3f3f3f3f;
const int maxn = 800000 + 5;
using namespace std;
struct node{
int q,d;
bool operator < (const node &p) const{
return d < p.d;
}
}a[maxn];
int main(){
int T, kases = 1;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
for(int i=0; i<n; i++){
scanf("%d%d",&a[i].q,&a[i].d);
}
sort(a,a+n);
priority_queue<int> q;
int cur = 0;
for(int i=0; i<n; i++){
if(cur + a[i].q <= a[i].d){
q.push(a[i].q);
cur += a[i].q;
}
else{
if(q.empty()) continue;
int temp = q.top();
if(a[i].q < temp){
cur = cur - temp + a[i].q;
q.pop();
q.push(a[i].q);
}
}
}
if(kases > 1) printf("\n");
printf("%d\n",(int)q.size());
kases++;
}
}