沙茶酱的代码库>__<

题解：经典贪心#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int n,now,tot; struct cow{ int s,e; }a[50005]; bool cmp(cow a,cow b){ return a.e<b.e; } int main() { c

题解：贪心出奇迹#include <iostream> #include <cstdio> #include <climits> #include <algorithm> using namespace std; #define INF INT_MAX int n,tot=-INF,sum; struct cow{ int w,p; }c[50005]; bool cmp(cow a,cow

题目链接题解：贪心干所有能干的，超时间后取消最小的#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[100