zoukankan      html  css  js  c++  java
  • CodeForces

    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;
    }
    

      

  • 相关阅读:
    Redis常见七种使用场景(PHP实战)
    session垃圾回收机制
    header 头各种类型文件下载
    SQL优化(面试题)
    spring中bean的生命周期
    JAVA的分布式锁
    Java微服务下的分布式事务介绍及其解决方案
    Java反射
    类加载的三种方式
    Sql语句的基本查询用法,两表联查,3表联查
  • 原文地址:https://www.cnblogs.com/clb123/p/10951685.html
Copyright © 2011-2022 走看看