Problem G. Pulp Fiction-Gym 100345G-贪心

来源：互联网发布：孕妇防辐射服知乎编辑：程序博客网时间：2024/06/06 08:25

要写n本书，要求平均时间最小，即∑ci 最小

对每本书，判断在下一次得到思路之前能否写完，能则写完(得到较小的ci)，否则写到下一次思路出现，判断开始是继续写比较优，还是开始写下一本书比较优。一直到n-1本书都进丢列了，然后把第n本插入队列，把队列中的书全部取出即可

#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include <iostream>#include <queue>#include <map>#include <set>#include <vector>using namespace std;#define INF 0x7f7f7f7fconst __int64 maxn = 100005;struct node{__int64 x,day;bool operator < (const node &b )const{return day>b.day;}};node tm[maxn];priority_queue <node> qq;__int64 cmp(node a,node b){return a.x<b.x;}int main(){  freopen( "pulp.in","r",stdin );  //scanf 从1.txt输入   freopen( "pulp.out","w",stdout );  //printf输出到1.tx__int64 n,i;scanf("%I64d",&n);for (i=1;i<=n;i++){scanf("%I64d%I64d",&tm[i].x,&tm[i].day);}sort(tm+1,tm+1+n,cmp);__int64 now=tm[1].x;__int64 ans=0;for (i=1;i<n;i++){qq.push(tm[i]);while(now<tm[i+1].x){if (!qq.empty()){node tmp=qq.top();qq.pop();if (tmp.day<=tm[i+1].x-now){now+=tmp.day;ans+=now;}else{tmp.day-=(tm[i+1].x-now);now=tm[i+1].x;qq.push(tmp);}}else{now=tm[i+1].x;} }}qq.push(tm[n]);while(!qq.empty()){node tmp=qq.top();qq.pop();now+=tmp.day;ans+=now;}printf("%I64d\n",ans);return 0;}

0 0