Lesha plays the recently published new version of the legendary game hacknet. In this version character skill mechanism was introduced. Now, each player character has exactly n skills. Each skill is represented by a non-negative integer a_i — the current skill level. All skills have the same maximum level A.

Along with the skills, global ranking of all players was added. Players are ranked according to the so-called Force. The Force of a player is the sum of the following values:

• The number of skills that a character has perfected (i.e., such that a_i = A), multiplied by coefficient c_f.
• The minimum skill level among all skills (min a_i), multiplied by coefficient c_m.

Now Lesha has m hacknetian currency units, which he is willing to spend. Each currency unit can increase the current level of any skill by 1 (if it's not equal to A yet). Help him spend his money in order to achieve the maximum possible value of the Force.

The first line of the input contains five space-separated integers n, A, c_f, c_m and m (1 ≤ n ≤ 100 000, 1 ≤ A ≤ 10⁹, 0 ≤ c_f, c_m ≤ 1000, 0 ≤ m ≤ 10¹⁵).

The second line contains exactly n integers a_i (0 ≤ a_i ≤ A), separated by spaces, — the current levels of skills.

On the first line print the maximum value of the Force that the character can achieve using no more than m currency units.

On the second line print n integers a'_i (a_i ≤ a'_i ≤ A), skill levels which one must achieve in order to reach the specified value of the Force, while using no more than m currency units. Numbers should be separated by spaces.

In the first test the optimal strategy is to increase the second skill to its maximum, and increase the two others by 1.

In the second test one should increase all skills to maximum.

简单题意

你有n个技能可以学，你有m个技能点可以分配，每个技能的上限值都是A，每个技能都给出了至少要学的等级，然后你要合理分配技能点，使得战力最大

战力=满级技能*Cf+最小等级*Cm

然后我们枚举满级的技能个数，显然我们应该把那些至少学习等级大的点成满级，然后剩下的技能尽量最小等级最大

所以我们一开始从小到大排序，枚举后面i个变成满级，前面的二分最小等级，用前缀和判断可行性，然后计算出战力，更新答案

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 const int maxn=;

 long long A,cf,cm,n,w,a[maxn],b[maxn],s[maxn],ans,tmp1,tmp2;

 bool compare(long long x,long long y){

     return a[x]<a[y];

 }

 long long find(long long x,long long rr){

     long long l,r,mid;

     l=;r=rr;

     while(l!=r){

         mid=(l+r+)/;

         if(a[b[mid]]<x)l=mid;

         else r=mid-;

     }

     return l;

 }

 int main(){

     scanf("%I64d%I64d%I64d%I64d%I64d",&n,&A,&cf,&cm,&w);

     long long i;

     for(i=;i<=n;i++)scanf("%I64d",&a[i]);

     for(i=;i<=n;i++)b[i]=i;

     sort(b+,b++n,compare);

     for(i=;i<=n;i++)s[i]=s[i-]+a[b[i]];

     w+=s[n];

     ans=-;

     for(i=;i<=n+;i++){

         if(A*(n-i+)+s[i-]>w)continue;

         if(i==)ans=cf*n+cm*A,tmp1=;

         if(i==)break;

         long long l=a[b[]],r=A,mid,tt;

         while(l!=r){

             mid=(l+r+)/;

             tt=find(mid,i-);

             if(A*(n+-i)+mid*tt+s[i-]-s[tt]<=w)l=mid;

             else r=mid-;

         }

         if(ans<cf*(n+-i)+l*cm)ans=cf*(n+-i)+l*cm,tmp1=i,tmp2=l;

     }

     printf("%I64d\n",ans);

     for(i=;i<tmp1;i++)

     if(a[b[i]]<tmp2)a[b[i]]=tmp2;

     for(i=tmp1;i<=n;i++)a[b[i]]=A;

     for(i=;i<=n;i++)printf("%I64d ",a[i]);

     return ;

 }