# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28474 | 탕탕탕! 핑거팁 니 맘을 겨눌게~ (#68) | Wine Tasting (FXCUP2_wine) | C11 | 0 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 <stdlib.h>
int wine[300000];
int compare_func(void* arg1, void* arg2) {
return (*(int*)arg1 - *(int*)arg2);
}
int main() {
int N, K, i, first = 0, end = 1;
long long int flavor = 0;
scanf("%d %d", &N, &K);
for (i = 0; i < N; i++)
scanf("%d", &wine[i]);
qsort(wine, N, sizeof(int), compare_func);
for (i = 0; i < K; i++) {
if (i == 0) {
flavor = wine[N - end];
end++;
continue;
}
if (i % 2 == 0) {
flavor += wine[N - end] - wine[0 + first];
end++;
first++;
}
}
printf("%lld", flavor);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |