# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
28346 | 2017-07-16T04:54:08 Z | :thinking_face:(#1137, zych1751, Acka, suzy) | 포도주 시음 (FXCUP2_wine) | C++11 | 109 ms | 3192 KB |
#include<bits/stdc++.h> using namespace std; int arr[300000]; long long ret = 0; int main() { int n, k; scanf("%d %d", &n, &k); for(int i = 0; i < n; i++) scanf("%d", arr+i); sort(arr, arr+n); int l = 0, r = n-1; bool right = true; long long ret = 0; int prev = 0; while(k--) { if(right) ret += arr[r--] - prev; else prev = arr[l++]; right = !right; } printf("%lld\n", ret); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3192 KB | Output is correct |
2 | Correct | 0 ms | 3192 KB | Output is correct |
3 | Correct | 0 ms | 3192 KB | Output is correct |
4 | Correct | 0 ms | 3192 KB | Output is correct |
5 | Correct | 0 ms | 3192 KB | Output is correct |
6 | Correct | 0 ms | 3192 KB | Output is correct |
7 | Correct | 0 ms | 3192 KB | Output is correct |
8 | Correct | 0 ms | 3192 KB | Output is correct |
9 | Correct | 0 ms | 3192 KB | Output is correct |
10 | Correct | 0 ms | 3192 KB | Output is correct |
11 | Correct | 0 ms | 3192 KB | Output is correct |
12 | Correct | 0 ms | 3192 KB | Output is correct |
13 | Correct | 0 ms | 3192 KB | Output is correct |
14 | Correct | 0 ms | 3192 KB | Output is correct |
15 | Correct | 0 ms | 3192 KB | Output is correct |
16 | Correct | 0 ms | 3192 KB | Output is correct |
17 | Correct | 3 ms | 3192 KB | Output is correct |
18 | Correct | 3 ms | 3192 KB | Output is correct |
19 | Correct | 3 ms | 3192 KB | Output is correct |
20 | Correct | 6 ms | 3192 KB | Output is correct |
21 | Correct | 19 ms | 3192 KB | Output is correct |
22 | Correct | 26 ms | 3192 KB | Output is correct |
23 | Correct | 29 ms | 3192 KB | Output is correct |
24 | Correct | 29 ms | 3192 KB | Output is correct |
25 | Correct | 86 ms | 3192 KB | Output is correct |
26 | Correct | 89 ms | 3192 KB | Output is correct |
27 | Correct | 109 ms | 3192 KB | Output is correct |
28 | Correct | 69 ms | 3192 KB | Output is correct |
29 | Correct | 89 ms | 3192 KB | Output is correct |
30 | Correct | 83 ms | 3192 KB | Output is correct |
31 | Correct | 86 ms | 3192 KB | Output is correct |
32 | Correct | 99 ms | 3192 KB | Output is correct |
33 | Correct | 0 ms | 3192 KB | Output is correct |
34 | Correct | 13 ms | 3192 KB | Output is correct |