B. Before an Examtime

			B. Before an Examtime

limit per test0.5 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputTomorrow Peter has a Biology exam. He does not like this subject much, but d days ago he learnt that he would have to take this exam. Peter’s strict parents made him prepare for the exam immediately, for this purpose he has to study not less than minTimei and not more than maxTimei hours per each i-th day. Moreover, they warned Peter that a day before the exam they would check how he has followed their instructions.So, today is the day when Peter’s parents ask him to show the timetable of his preparatory studies. But the boy has counted only the sum of hours sumTime spent him on preparation, and now he wants to know if he can show his parents a timetable sсhedule with d numbers, where each number sсhedulei stands for the time in hours spent by Peter each i-th day on biology studies, and satisfying the limitations imposed by his parents, and at the same time the sum total of all schedulei should equal to sumTime.InputThe first input line contains two integer numbers d, sumTime (1 ≤ d ≤ 30, 0 ≤ sumTime ≤ 240) — the amount of days, during which Peter studied, and the total amount of hours, spent on preparation. Each of the following d lines contains two integer numbers minTimei, maxTimei (0 ≤ minTimei ≤ maxTimei ≤ 8), separated by a space — minimum and maximum amount of hours that Peter could spent in the i-th day.OutputIn the first line print YES, and in the second line print d numbers (separated by a space), each of the numbers — amount of hours, spent by Peter on preparation in the corresponding day, if he followed his parents’ instructions; or print NO in the unique line. If there are many solutions, print any of them.ExamplesinputCopy
1 48
5 7
outputCopy
NO
inputCopy
2 5
0 1
3 5
outputCopy
YES
1 4
这道题说简单也简单，我的思路是记录下次的最长时间n然后再用他和sumtime去比较（这里没有判断最小之和如果大于sumtime，于是乎wa了7 8次吧），之后的方法和别人有所不同，
我是将（sumtime-每一次的最小值）（s1）和（n-每次的最大值）（s2)进行比较，如果是 —s1<=s2，那么直接输出当前数的最小值，如果出现了–s1>s2，这就说明“转折点出现“，这时候输出t（sumtime-t=n-每次的最大值）。
#include “iostream”
#include “algorithm”
using namespace std;
struct node
{
int mintime;
int maxtime;
}p[50];
int main()
{
int d,sumtime;
while(cin>>d>>sumtime)
{
int n=0,t=0,s=0;
for(int i=1;i<=d;i++)
{
cin>>p[i].mintime>>p[i].maxtime;
n+=p[i].maxtime;
s+=p[i].mintime;
}
if(n>=sumtime&&s<=sumtime)
{
cout<<“YES”<<endl;
for(int i=1;i<=d;i++)
{
if(n==sumtime)
{
cout<<p[i].maxtime<<" “;
continue;
}
if(n-p[i].maxtime>=sumtime-p[i].mintime)
{
n-=p[i].maxtime;
sumtime-=p[i].mintime;
cout<<p[i].mintime<<” “;
}
else if(n-p[i].maxtime<sumtime-p[i].mintime)
{
n-=p[i].maxtime;
cout<<sumtime-n<<” ";
sumtime=n;
}
}
}
else cout<<“NO”<<endl;
}
return 0;
}