# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28255 | 2017-07-16T04:12:11 Z | AcornCkiGuiziTeam(#1202, dotorya, cki86201, zigui) | Wine Tasting (FXCUP2_wine) | C++14 | 89 ms | 3192 KB |
#include <stdio.h> #include <algorithm> #include <assert.h> #include <bitset> #include <cmath> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits.h> #include <map> #include <math.h> #include <queue> #include <set> #include <stdlib.h> #include <string.h> #include <string> #include <time.h> #include <unordered_map> #include <unordered_set> #include <vector> #pragma warning(disable:4996) #pragma comment(linker, "/STACK:1048576") using namespace std; #define mp make_pair #define all(x) (x).begin(), (x).end() #define ldb ldouble typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair <int, int> pii; typedef pair <ll, ll> pll; typedef pair <ll, int> pli; typedef pair <db, db> pdd; typedef tuple <int, int, int> t3; int IT_MAX = 1 << 17; const ll MOD = 1000000007; const int INF = 0x3f3f3f3f; const ll LL_INF = 0x3f3f3f3f3f3f3f3f; const db PI = acos(-1); const db ERR = 1e-10; #define szz(x) (int)(x).size() #define rep(i, n) for(int i=0;i<(n);i++) int in[300050]; int main() { int N, K, i; scanf("%d %d", &N, &K); for (i = 1; i <= N; i++) scanf("%d", &in[i]); sort(in + 1, in + N + 1); ll s = 0; for (i = N; i > N - (K + 1) / 2; i--) s += in[i]; for (i = 1; i < (K + 1) / 2; i++) s -= in[i]; return !printf("%lld\n", s); }
Compilation message
# | Verdict | Execution time | Memory | 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 | 9 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 | 33 ms | 3192 KB | Output is correct |
23 | Correct | 29 ms | 3192 KB | Output is correct |
24 | Correct | 23 ms | 3192 KB | Output is correct |
25 | Correct | 86 ms | 3192 KB | Output is correct |
26 | Correct | 76 ms | 3192 KB | Output is correct |
27 | Correct | 89 ms | 3192 KB | Output is correct |
28 | Correct | 59 ms | 3192 KB | Output is correct |
29 | Correct | 89 ms | 3192 KB | Output is correct |
30 | Correct | 76 ms | 3192 KB | Output is correct |
31 | Correct | 89 ms | 3192 KB | Output is correct |
32 | Correct | 89 ms | 3192 KB | Output is correct |
33 | Correct | 0 ms | 3192 KB | Output is correct |
34 | Correct | 16 ms | 3192 KB | Output is correct |