oj.uz

Submission #28285

# Submission time Handle Problem Language Result Execution time Memory
28285 2017-07-16T04:24:04 Z Official Fan of ACG(#1221, cseteram, 16silver, pps789) Wine Tasting (FXCUP2_wine) C++14
1 / 1
 99 ms 3104 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;

int main()
{
	int n, k;
	scanf("%d%d", &n, &k);
	vector<int> a(n);
	for (int i = 0; i < n; i++)
		scanf("%d", &a[i]);
	sort(a.begin(), a.end());
	ll sum = 0;
	int last = 0, p = 0, q = n - 1;
	while (k > 1) {
		sum += (a[q--] - last);
		last = a[p++];
		k -= 2;
	}
	if (k == 1) sum += a[q] - last;
	printf("%lld\n", sum);
	return 0;
}

Compilation message

wine.cpp: In function 'int main()':
wine.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
                       ^
wine.cpp:13:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1932 KB Output is correct
2 Correct 0 ms 1932 KB Output is correct
3 Correct 0 ms 1932 KB Output is correct
4 Correct 0 ms 1932 KB Output is correct
5 Correct 0 ms 1932 KB Output is correct
6 Correct 0 ms 1932 KB Output is correct
7 Correct 0 ms 1932 KB Output is correct
8 Correct 0 ms 1932 KB Output is correct
9 Correct 0 ms 1932 KB Output is correct
10 Correct 0 ms 1932 KB Output is correct
11 Correct 0 ms 1932 KB Output is correct
12 Correct 0 ms 1932 KB Output is correct
13 Correct 0 ms 1932 KB Output is correct
14 Correct 0 ms 1932 KB Output is correct
15 Correct 0 ms 1932 KB Output is correct
16 Correct 0 ms 1932 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 3 ms 2124 KB Output is correct
19 Correct 6 ms 2124 KB Output is correct
20 Correct 6 ms 2124 KB Output is correct
21 Correct 16 ms 2324 KB Output is correct
22 Correct 29 ms 2324 KB Output is correct
23 Correct 23 ms 2324 KB Output is correct
24 Correct 26 ms 2324 KB Output is correct
25 Correct 86 ms 3104 KB Output is correct
26 Correct 83 ms 3104 KB Output is correct
27 Correct 96 ms 3104 KB Output is correct
28 Correct 46 ms 3104 KB Output is correct
29 Correct 79 ms 3104 KB Output is correct
30 Correct 93 ms 3104 KB Output is correct
31 Correct 86 ms 3104 KB Output is correct
32 Correct 99 ms 3104 KB Output is correct
33 Correct 0 ms 1932 KB Output is correct
34 Correct 16 ms 2324 KB Output is correct