# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28259 | tlwpdus 팬클럽 회장 (#68) | 포도주 시음 (FXCUP2_wine) | C++14 | 106 ms | 4364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll a[300010], ans;
int main(){
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++){
scanf("%lld", a + i);
}
sort(a + 1, a + n + 1);
if(k == 1){
printf("%lld\n", a[n]);
return 0;
}
k = (k + 1) / 2;
for(int i = 1; i <= k; i++){
if(i == 1) ans += a[n + 1 - i];
else ans += a[n + 1 - i] - a[i - 1];
}
printf("%lld\n", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |