贪心,注意mini的存在
#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<functional> #include<iostream> #include<cmath> #include<cctype> #include<ctime> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #define Fork(i,k,n) for(int i=k;i<=n;i++) #define Rep(i,n) for(int i=0;i<n;i++) #define ForD(i,n) for(int i=n;i;i--) #define RepD(i,n) for(int i=n;i>=0;i--) #define Forp(x) for(int p=pre[x];p;p=next[p]) #define Forpiter(x) for(int &p=iter[x];p;p=next[p]) #define Lson (x<<1) #define Rson ((x<<1)+1) #define MEM(a) memset(a,0,sizeof(a)); #define MEMI(a) memset(a,127,sizeof(a)); #define MEMi(a) memset(a,128,sizeof(a)); #define INF (2139062143) #define F (100000007) typedef long long ll; ll mul(ll a,ll b){return (a*b)%F;} ll add(ll a,ll b){return (a+b)%F;} ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;} void upd(ll &a,ll b){a=(a%F+b%F)%F;} int a[5][5],ans[5]; int main() { freopen("A.in","r",stdin); // freopen(".out","w",stdout); int n; cin>>n; For(i,3) For(j,2) cin>>a[i][j]; For(i,3) ans[i]=a[i][1],n-=ans[i]; For(i,3) { if (n>0&&ans[i]<a[i][2]) { int p=min(n,a[i][2]-ans[i]); ans[i]+=p; n-=p; } } cout<<ans[1]; Fork(i,2,3) cout<<' '<<ans[i]; cout<<endl; return 0; }