# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1198301 | 4o2a | K blocks (IZhO14_blocks) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define _F "test"
using namespace std;
typedef long long ll;
void solve()
{
int n, k; cin>>n>>k;
vector<int> val(n);
for (int i = 0; i < n; ++i)
cin>>val[i];
sort(val.begin(), val.end());
int s = n-1;
while (s >= 0 && val[s] == val[n-1]) --s;
ll ans = 1ll*(n-s-1)*val[n-1];
for (int i = 0; i < k - (n-s-1); ++i)
ans += val[i];
cout<<ans;
}
int main()
{
if (fopen(_F".INP", "r"))
{
freopen(_F".INP", "r", stdin);
//freopen(_F".OUT", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
int Test = 1; //cin>>Test;
while (Test--) solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |