A. Ilya and Diplomas

Time Limit: 20 Sec

Memory Limit: 256 MB

題目連接

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

Description

Soon a school Olympiad in Informatics will be held in Berland, n schoolchildren will participate there.

At a meeting of the jury of the Olympiad it was decided that each of the n participants, depending on the results, will get a diploma of the first, second or third degree. Thus, each student will receive exactly one diploma.

They also decided that there must be given at least min1 and at most max1 diplomas of the first degree, at least min2 and at most max2 diplomas of the second degree, and at least min3 and at most max3 diplomas of the third degree.

After some discussion it was decided to choose from all the options of distributing diplomas satisfying these limitations the one that maximizes the number of participants who receive diplomas of the first degree. Of all these options they select the one which maximizes the number of the participants who receive diplomas of the second degree. If there are multiple of these options, they select the option that maximizes the number of diplomas of the third degree.

Choosing the best option of distributing certificates was entrusted to Ilya, one of the best programmers of Berland. However, he found more important things to do, so it is your task now to choose the best option of distributing of diplomas, based on the described limitations.

It is guaranteed that the described limitations are such that there is a way to choose such an option of distributing diplomas that all n participants of the Olympiad will receive a diploma of some degree.

Input

The first line of the input contains a single integer n (3?≤?n?≤?3·106) — the number of schoolchildren who will participate in the Olympiad.

The next line of the input contains two integers min1 and max1 (1?≤?min1?≤?max1?≤?106) — the minimum and maximum limits on the number of diplomas of the first degree that can be distributed.

The third line of the input contains two integers min2 and max2 (1?≤?min2?≤?max2?≤?106) — the minimum and maximum limits on the number of diplomas of the second degree that can be distributed.

The next line of the input contains two integers min3 and max3 (1?≤?min3?≤?max3?≤?106) — the minimum and maximum limits on the number of diplomas of the third degree that can be distributed.

It is guaranteed that min1?+?min2?+?min3?≤?n?≤?max1?+?max2?+?max3.

Output

In the first line of the output print three numbers, showing how many diplomas of the first, second and third degree will be given to students in the optimal variant of distributing diplomas.

The optimal variant of distributing diplomas is the one that maximizes the number of students who receive diplomas of the first degree. Of all the suitable options, the best one is the one which maximizes the number of participants who receive diplomas of the second degree. If there are several of these options, the best one is the one that maximizes the number of diplomas of the third degree.

Sample Input

6
1 5
2 6
3 7

Sample Output

1 2 3

HINT

?

題意

a>b>c,a+b+c=n

告訴你a,b,c的取值范圍，讓你構(gòu)造出a,b,c的值

題解：

數(shù)學(xué)題啦

具體看代碼~

代碼

?

#include <cstdio> #include <cmath> #include <cstring> #include <ctime> #include <iostream> #include <algorithm> #include <set> #include <vector> #include <sstream> #include <queue> #include <typeinfo> #include <fstream> #include <map> #include <stack> typedef long long ll; using namespace std; //freopen("D.in","r",stdin); //freopen("D.out","w",stdout); #define sspeed ios_base::sync_with_stdio(0);cin.tie(0) #define test freopen("test.txt","r",stdin) #define maxn 100005 #define mod 10007 #define eps 1e-9 const int inf=0x3f3f3f3f; const ll infll = 0x3f3f3f3f3f3f3f3fLL; inline ll read() {ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f; } //**************************************************************************************int main() {int n=read();int a[4],b[4];for(int i=1;i<=3;i++)a[i]=read(),b[i]=read();int ans[4];ans[1]=min(n-a[2]-a[3],b[1]);n-=ans[1];ans[2]=min(n-a[3],b[2]);ans[3]=n-ans[2];cout<<ans[1]<<" "<<ans[2]<<" "<<ans[3]<<endl;}

?

轉(zhuǎn)載于:https://www.cnblogs.com/qscqesze/p/4612209.html

總結(jié)

以上是生活随笔為你收集整理的Codeforces Round #311 (Div. 2) A. Ilya and Diplomas 水题的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。