题解:贪心干所有能干的,超时间后取消最小的
#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int now,n;
long long s;
priority_queue <int> q;
struct cow{
int s,v;
}c[100005];
bool cmp(cow a,cow b){
return a.s<
题解:贪心干所有能干的,超时间后取消最小的
#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int now,n;
long long s;
priority_queue <int> q;
struct cow{
int s,v;
}c[100005];
bool cmp(cow a,cow b){
return a.s<