# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28322 | ㅁㄴㅇㄹ호 (#68) | Wine Tasting (FXCUP2_wine) | C++14 | 109 ms | 2288 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 <stdio.h>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <tuple>
using namespace std;
int arr[300010];
int main()
{
//freopen("in", "r", stdin);
//freopen("out", "w", stdout);
int n, k, i;
long long res;
scanf("%d%d", &n, &k);
for(i = 0; i<n; i++)
scanf("%d", &arr[i]);
sort(arr, arr+n);
res = arr[n-1];
for(i = 1; i<k; i++)
{
if(n-1-i/2 <= i/2-1)
break;
if(i % 2 == 0)
res += 0LL + arr[n-1-i/2] - arr[i/2-1];
}
printf("%lld", res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |