加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 大数据 > 正文

CodeForces - 4B

发布时间:2020-12-14 04:45:48 所属栏目:大数据 来源:网络整理
导读:Tomorrow 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 le

Tomorrow Peter has a Biology exam. He does not like this subject much,but?ddays 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?sumTimespent 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.

Input

The 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.

Output

In 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.

Examples

Input
1 48
5 7
Output
NO
Input
2 5
0 1
3 5
Output
YES
1 4




思路:直接先从最少的复习时间开始,不够的慢慢累加,最后判断输出 就行

#include<bits/stdc++.h>
using namespace std;
int a[101],b[101],ans[101];
int main()
{
	int n,m,i;
	cin>>n>>m;
	for(i = 0; i < n; i++){
		cin>>a[i]>>b[i];
		m -= a[i];
	}
	if(m < 0){   //肯定不符合
		cout<<"NO"<<endl;
		return 0;
	}
	for(i = 0; i < n; i++){  //慢慢加上
		ans[i] = a[i];
		int h = b[i]-a[i];
		if(h < m){
			m -= h;
			ans[i] += h;
		}
		else{
			ans[i] += m;
			m = 0;
		}
	}
	if(m){
		cout<<"NO"<<endl;
		return 0;
	}
	cout<<"YES"<<endl<<ans[0];
	for(i = 1; i < n; i++){
		printf(" %d",ans[i]);
	}
	return 0;
}

(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读