#include #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define maxs(x,y) (x = max(x,y)) #define mins(x,y) (x = min(x,y)) #define isin(x,l,r) ((l) <= (x) && (x) < (r)) #define pb push_back #define eb emplace_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define uni(x) x.erase(unique(rng(x)),x.end()) #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define show(x) cout<<#x<<" = "< > #define bn(x) ((1< #define vv(T) v(v(T)) using namespace std; typedef long long int ll; typedef unsigned uint; typedef unsigned long long ull; typedef pair P; typedef tuple T; typedef vector vi; typedef vector vvi; typedef vector vl; typedef vector

vp; typedef vector vt; inline int getInt() { int x; scanf("%d",&x); return x;} templateinline istream& operator>>(istream&i,v(T)&v) {rep(j,sz(v))i>>v[j];return i;} templatestring join(const v(T)&v) {stringstream s;rep(i,sz(v))s<<' '<inline ostream& operator<<(ostream&o,const v(T)&v) {if(sz(v))o<inline istream& operator>>(istream&i,pair&v) {return i>>v.fi>>v.se;} templateinline ostream& operator<<(ostream&o,const pair&v) {return o<inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("-1"); return 0;} #define yn {puts("Yes");}else{puts("No");} const int MX = 200005; typedef __int128_t l3; typedef __uint128_t ul3; std::ostream &operator<<(std::ostream &o, l3 x) { string s; bool sg = x < 0; ul3 ux = sg?-x:x; do {s += '0'+ux%10; ux /= 10;} while (ux); if (sg) s += '-'; reverse(rng(s)); return o<>a; sort(rng(a)); rep(i,n) a[i] = dup(a[i]-1,k); ll s = suma(a); l3 ans = l3(s)*x; rep(i,n) { l3 now = l3(s-a[i]*ll(n-i))*x; now += (ll)y*a[i]; mins(ans,now); s -= a[i]; } cout<