Codeforces4B--区间必选背包

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>

typedef short int int16;///32767
typedef int int32;///2147483647
typedef long long int64;///9223372036854775807
const double PI=acos(-1.0);///3.141593
const long long MOD=(long long)1E9+7LL;///1000000007
int isdigit(int c);int islower(int c);int isupper(int c);
int tolower(int c);int toupper(int c);
template <class T> T Susake_pow(T a,T b)///pow
{T res;if(b==0) return 1;else while((b&1)==0){b>>=1;a*=a;}res=a;b>>=1;while(b!=0){a*=a;if((b&1)!=0)res*=a;b>>=1;}return res;}
template<class T> inline T gcd(T a,T b)///gcd
{if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<class T> inline T lcm(T a,T b)///lcm
{if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
template<class T> inline char *Susake_nsystem(T n)///itoa(26)
{T t=0,i;char *s,*p;s=(char *)malloc(sizeof(char)*1000);p=(char *)malloc(sizeof(char)*1000);
while(n){s[t]=n%26+64;if(s[t]==64){s[t]+=26;n-=26;}t++;n/=26;}s[t]=‘\0‘;for(i = 0; i < t; i++)p[i]=s[t-1-i];p[i]=‘\0‘;free(s);return p;}
int Susake_system(char *s)///atoi(26)
{int len=strlen(s),i,sum=0;char p[1000];for(i=0;i<len;i++)p[i]=s[len-1-i]-64;for(i=0;i<len;i++)sum+=p[i]*Susake_pow(26,i);return sum;}
int fa[1];
template <class T> T union_find(T x)///union_find
{return fa[x] == x ? x : fa[x] = union_find(fa[x]);}

const int maxn = 105;
const int maxm = 10005;

int a[maxn], b[maxn], ans[maxn];

int main() {
    int n, sum;
    int s1 = 0, s2 = 0;
    scanf ("%d %d", &n, &sum);
    for (int i = 0; i < n; i++)
        scanf ("%d %d", &a[i], &b[i]), s1 += a[i], s2 += b[i];
    if (s1 > sum || s2 < sum)
        printf ("NO\n");
    else
    {
        printf ("YES\n");
        for (int i = 0; i < n; i++)
            ans[i] = a[i], sum -= a[i];
        for (int i = 0; i < n && sum; i++)
        {
            while (ans[i] < b[i] && sum)
            {
                ans[i]++;
                sum--;
            }
        }
        for (int i = 0; i < n; i++)
        {
            if (i)
                printf (" ");
            printf ("%d", ans[i]);
        }
        printf ("\n");
    }
    return 0;
}