codeforces A. Ilya and Diplomas

来源：互联网发布：淘宝什么店铺女装好看编辑：程序博客网时间：2024/05/16 12:18

http://codeforces.com/contest/557/problem/A

#include<map>#include<vector>#include<cstdio>#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<cmath>#include<stack>#include<queue>#include<set>#define inf 0x3f3f3f3f#define mem(a,x) memset(a,x,sizeof(a))using namespace std;typedef long long ll;typedef pair<int,int> pii;inline ll in(){    ll res=0;char c;    while((c=getchar())<'0' || c>'9');    while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();    return res;}int main(){    int n=in();    int mn1=in(),mx1=in();    int mn2=in(),mx2=in();    int mn3=in(),mx3=in();    if(mx1+mx2+mn3<=n) //前两个都能取最大值，使第三个尽量大    {        cout<<mx1<<" "<<mx2<<" "<<n-mx1-mx2;        return 0;    }    if(mx1+mn2+mn3<=n)//第一个取最大值，第三个取最小值，使第二个尽量大（此时是排除了第一种情况）    {        cout<<mx1<<" "<<n-mx1-mn3<<" "<<mn3;        return 0;    }    if(mn1+mn2+mn3<=n)//使第一个尽量大，（此时排除了第一第二种情况）    {        cout<<n-mn2-mn3<<" "<<mn2<<" "<<mn3;        return 0;    }    return 0;}

0 0