# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151166 | 2019-09-02T01:24:22 Z | TAMREF | Wine Tasting (FXCUP2_wine) | C++11 | 2 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; int n, k, p[300005]; ll ans; int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin >> n >> k; for(int i = 0; i < n; i++) cin >> p[i]; sort(p, p+n); for(int i = 0; i < k/2; i++) ans -= p[i]; for(int i = 0; i < (k+1)/2; i++) ans += p[n-1-i]; cout << ans << '\n'; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |