35

#include<iostream>
#include<algorithm>
#include<cmath> 
using namespace std;
bool comp(int a,int b){return a>b; };
int main()
{
    int x,i,j,n,m,q,u,v,t;
    double p;
    int length[10000001];
    cin>>n>>m>>q>>u>>v>>t;
    p=double(u)/double(v);
    for(i=1;i<=n;i++)cin>>length[i];
    sort(length+1,length+n+1,comp);
    for(i=1;i<=m;i++)
    {
        x=length[1];
        if(i%t==0&&i<=m)cout<<x<<" ";
        length[1]=floor(p*x);
        length[n+i]=x-floor(p*x);
        for(j=2;j<n+i;j++)length[j]+=q;
        sort(length+1,length+n+i+1,comp);
    }
    cout<<endl;
    for(i=1;i<=n+m;i++) if(i%t==0)cout<<length[i]<<" ";
    cout<<endl; return 0;
}
帮！！！