Emotes(模拟)

B. Emotes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are nn emotes in very popular digital collectible card game (the game is pretty famous so we won't say its name). The ii-th emote increases the opponent's happiness by aiai units (we all know that emotes in this game are used to make opponents happy).

You have time to use some emotes only mm times. You are allowed to use any emotion once, more than once, or not use it at all. The only restriction is that you cannot use the same emote more than kk times in a row (otherwise the opponent will think that you're trolling him).

Note that two emotes ii and jj (i≠ji≠j) such that ai=ajai=aj are considered different.

You have to make your opponent as happy as possible. Find the maximum possible opponent's happiness.

Input

The first line of the input contains three integers n,mn,m and kk (2≤n≤2⋅1052≤n≤2⋅105, 1≤k≤m≤2⋅1091≤k≤m≤2⋅109) — the number of emotes, the number of times you can use emotes and the maximum number of times you may use the same emote in a row.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109), where aiai is value of the happiness of the ii-th emote.

Output

Print one integer — the maximum opponent's happiness if you use emotes in a way satisfying the problem statement.

Examples

input

Copy

6 9 2
1 3 3 7 4 2

output

Copy

54

input

Copy

3 1000000000 1
1000000000 987654321 1000000000

output

Copy

1000000000000000000

Note

In the first example you may use emotes in the following sequence: 4,4,5,4,4,5,4,4,54,4,5,4,4,5,4,4,5.

给一段数组a长为n

求一段新数组长b为m,新数组由a数组元素组成,同一元素在b中不可以连续长度大于k    (若ai==aj,若i!=j,则ai和aj不上同一元素)

求b数组和的最大值

解析:

给a排序

如果a中最大的元素不止1个,呢么答案是:a[n-1]*m      (相互交替放入b数组)

否则一段为: (k个最大的,1个第二大的)为一段,共有m/(k+1)段,最后根到m%(k+1)个最大的

m/(k+1)*(k*a[n-1]+a[n-2])+m%(k+1)*a[n-1]

ac:

#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<r;i++)
#define mem(gv) memset(gv,0,sizeof(gv))
#define ll long long
#define MAXN 300005
using namespace std;

ll a[MAXN]={0};

int main()
{
    ll n,m,k;
    scanf("%lld%lld%lld",&n,&m,&k);
    for(ll i=0;i<n;i++)
        scanf("%lld",&a[i]);
    sort(a,a+n);

    if(a[n-1]==a[n-2])
        cout<<a[n-1]*m<<endl;
    else{
        //cout<<m/(k+1)<<" "<<m%(k+1)<<endl;
        cout<<m/(k+1)*(k*a[n-1]+a[n-2])+m%(k+1)*a[n-1]<<endl;
    }

    return 0;
}