http://codeforces.com/problemset/problem/4/B

彼得明天有一场生物考试,父母为他制定了严格的复习计划。本程序帮助检查彼得是否遵循了每天的学习时间限制,并确保总学习时间符合要求。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

B. Before an Exam
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output

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

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.

Sample test(s)
Input
1 48
5 7
Output
NO
Input
2 5
0 1
3 5
Output
YES
1 4 

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int ans[50];
    int d,sumTime;
    int time[50][2];
    int min,max;
    while(scanf("%d%d",&d,&sumTime)!=EOF)
    {
        min=0;
        max=0;
        for(int i=0;i<d;i++)
        {
            scanf("%d%d",&time[i][0],&time[i][1]);
            min+=time[i][0];
            max+=time[i][1];
        }
        if(min<=sumTime&&sumTime<=max)
        {
            printf("YES\n");
            int dis=sumTime-min;
            for(int i=0;i<d;i++)
            {
                if(i!=0)
                printf(" ");
                if(dis<=time[i][1]-time[i][0])
                {
                    printf("%d",dis+time[i][0]);
                    dis=0;
                }
                else
                {
                    printf("%d",time[i][1]);
                    dis=dis-(time[i][1]-time[i][0]);
                }
            }
            printf("\n");
        }
        else printf("NO\n");
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值