# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28389 | lyzqm123 (#68) | Wine Tasting (FXCUP2_wine) | C++11 | 109 ms | 3460 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 <cstdio>
#include <algorithm>
using namespace std;
long long arr[300001];
int main() {
int N, K;
scanf("%d%d", &N, &K);
for (int n = 0;n < N;n++) scanf("%lld", &arr[n]);
sort(arr, arr + N);
long long ans = arr[N - 1];K--;
int l = 0, r = N - 2;
while (K - 2 >= 0 && l <= r) {
ans += arr[r] - arr[l];
K -= 2;
r--;
l++;
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |