[CodeForces - 614D] D - Skills

D - Skills

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.

Input

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.

Output

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.

Example

Input

3 5 10 1 5
1 3 1

Output

12
2 5 2 

Input

3 5 10 1 339
1 3 1

Output

35
5 5 5 

Note

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.

题目的意思是,有几个技能,每个技能有一个初始等级,所有技能有一个共同的最大等级限度.现在你有几次升级的机会,要求升级之后,某个值最大化.

其中,这个值的计算方式是,满级的个数*常数1+等级最低值*常数2.

那么,我们可以枚举满级的个数,然后二分求解最小值,并且尽可能使其最大化.

假设我们现在枚举了有i个满级的,那么,要计算出剩下的钱还有多少,然后进行二分答案,枚举low,表示想让所有的等级都不小于low.

那么原来等级小于low的肯定要升级,花钱.如果钱够花就可以.

但是又有一个问题,在枚举+二分时,已经是nlogn的复杂度了,再套个n肯定TLE.而我们有需要知道,到底有几个等级小于low,以及总共少了多少.那么,对于这个问题,我们可以通过二分查找来实现.

所以,最后的复杂度是nlogn^2(注意,在更新答案的时候不要o(n)更新!!!可以取几个关键的值,最后再更新,还要注意数据类型).

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 const int maxn=100005;
 6 int n,A,out[maxn];
 7 struct data{
 8     int x,i;
 9     bool operator < (const data &u) const {return x<u.x;}
10 }cur[maxn];
11 long long cf,cm,m;
12 long long s[maxn],ans;
13 int f1,f2,f3;
14 inline long long read(){
15     long long x=0; char ch=getchar();
16     while (ch<'0'||ch>'9') ch=getchar();
17     while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
18     return x;
19 }
20 int bis(int low){
21     int l=1,r=n,md;
22     if (low<=cur[l].x) return 0;
23     if (low>cur[r].x) return r;
24     while (l<=r){
25         md=(l+r)>>1;
26         if (cur[md-1].x<low&&low<=cur[md].x) return md-1;
27         if (low<=cur[md-1].x) r=md-1; else if (low>cur[md].x) l=md+1;
28     }
29 }
30 bool jug(int low,long long money,int num){
31     int x=min(n-num,bis(low));
32     long long s1=s[x],s2=(long long)low*x;
33     if (s1+money>=s2){
34         if (ans>=cf*num+cm*low) return 1;
35         ans=cf*num+cm*low; f1=low; f2=x; f3=num;
36         return 1;
37     }
38     return 0;
39 }
40 int main(){
41     n=(int)read(),A=(int)read(),cf=read(),cm=read(),m=read(),s[0]=0;
42     for (int i=1; i<=n; i++) cur[i].x=(int)read(),cur[i].i=i; cur[n+1].x=A;
43     sort(cur+1,cur+1+n);
44     memset(out,0,sizeof out);
45     ans=cm*cur[1].x;
46     for (int i=1; i<=n; i++) if (cur[i].x==A) ans+=cf;
47     for (int i=1; i<=n; i++) out[cur[i].i]=cur[i].x;
48     for (int i=1; i<=n; i++) s[i]=s[i-1]+cur[i].x;
49     long long sum=0;
50     for (int i=0; i<=n; i++){
51         if (A>cur[n-i+1].x) sum+=A-cur[n-i+1].x;
52         if (sum>m) break;
53         int L=cur[1].x,R=A,mid;
54         while (L<=R){
55             mid=(L+R)>>1;
56             if (jug(mid,m-sum,i)) L=mid+1; else R=mid-1;
57         }
58     }
59     memset(out,0,sizeof out);
60     for (int i=1; i<=f2; i++) out[cur[i].i]=f1;
61     for (int i=f2+1; i<=n-f3; i++) out[cur[i].i]=cur[i].x;
62     for (int i=n-f3+1; i<=n; i++) out[cur[i].i]=A;
63     printf("%lld\n",ans);
64     for (int i=1; i<=n; i++) printf("%d ",out[i]);
65     return 0;
66 }

View Code

 

转载于:https://www.cnblogs.com/whc200305/p/7217403.html