Codeforces 4B Before an Exam

贪心

#include <cstdio>
#include <algorithm>
using namespace std;

struct node{
	int u,l,r,idx;
	node(int au=0,int al=0,int ar=0,int ai=0):u(au),l(al),idx(ai),r(ar) {}
};

inline bool cmpbyu(const node& a,const node& b)
{
	return a.u>b.u;
}

inline bool cmpbyidx(const node& a,const node& b)
{
	return a.idx<b.idx;
}

node day[50];


int main()
{
	int d,sumTime;
	scanf("%d%d",&d,&sumTime);
	for(int i=0;i<d;i++)
	{
		int u,l;
		scanf("%d%d",&l,&u);
		day[i]=node(u,l,0,i);
	}
	for(int i=0;i<d;i++)
	{
		sumTime-=day[i].l;
		day[i].r=day[i].l;
		//printf("Sumtime=%d\n",sumTime); //=>for debug
	}
	if(sumTime<0)
	{
		//printf("sumTime<0!\n"); // ==>for debug
		printf("NO\n");
	}
	else
	{
		if(sumTime>0)
		{
			int i=0;
			sort(day,day+d,cmpbyu);
			while( sumTime>0&&i<d )
			{
				if((sumTime-(day[i].u-day[i].l))>=0)
				{
					//printf(">0\n"); //fordbg
					sumTime=sumTime-(day[i].u-day[i].l);
					day[i].r=day[i].u;					
				}
				else if( (sumTime - (day[i].u-day[i].l))<0 )
				{
					//printf("<0\n"); //fordbg
					day[i].r+=sumTime;
					sumTime=0;
				}
				i++;
			}
		}
		if(sumTime==0)
		{
			printf("YES\n");
			sort(day,day+d,cmpbyidx);
			for(int i=0;i<d;i++)
			{
				printf(i==d-1?"%d\n":"%d ",day[i].r);
			}	
		}
		else
		{
			//printf("sumTime!=0 sumTime=%d\n",sumTime); // ==> for debug
			printf("NO\n");
		}
	}
	return 0;
}