# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28243 | xhae (#68) | Wine Tasting (FXCUP2_wine) | C++14 | 113 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 data[300000];
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++) scanf("%lld", data + i);
sort(data, data + n);
long long ans = data[n - 1];
int si = 0, ei = n - 2;
for(int i = 1; i < m; i++) {
if(i % 2 == 1) si++;
else ans += data[ei--] - data[si - 1];
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |