Keep the Customer Satisfied

题意:

给出n个任务的耗时和截止时间,求最多可接几单

思路:

类似的题目这几天都在做,所以很自然想到优先队列,wa了一发,原因是输出之间没有换行

先按照截止时间从小到大入队,然后耗时越多的越先出队

代码:

#include<cstdio>
#include<queue>
#include<cstring>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int maxn = 1000005;
struct job {
	int q, d;
	bool operator < (const job& a) const {
		return q<a.q;
	}
}j[maxn];
int n;
int cmp(job a, job b) {
	return a.d < b.d;
}
int main() { 
	int kase, first=1;
	scanf("%d", &kase);
	while(kase--) {
		if(first) first = 0;
		else printf("\n");
		scanf("%d", &n);
		for(int i=0; i<n; i++) {
			scanf("%d%d", &j[i].q, &j[i].d);
		}
		sort(j, j+n, cmp);
		priority_queue<job> p;
		int i = 0;
		int ans = 0;
		int num = 0;
		while(i < n) {
			ans += j[i].q;
			p.push(j[i]);
			num++;
			if(ans > j[i].d) {
				job tmp = p.top();
				ans -= tmp.q;
				p.pop();
				num--;
			}
			i++;
		}
		printf("%d\n", num);
	}
	return 0;
}