oj.uz

Submission #26926

# Submission time Handle Problem Language Result Execution time Memory
26926 2017-07-07T07:24:06 Z 검수팍(#1115) Wine Tasting (FXCUP2_wine) C++
1 / 1
 106 ms 3484 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;

typedef long long lld;
int N, K; lld ba[303030], sumU, sumD;

int main(){
	scanf("%d%d", &N, &K);
	if(K%2 == 0) K--;
	for(int i=0; i<N; i++) scanf("%lld", &ba[i]);
	sort(ba, ba+N);
	for(int i=0; i<K/2; i++) sumD += ba[i];
	for(int i=0; i<=K/2; i++) sumU += ba[N-1-i];
	printf("%lld\n", sumU - sumD);
	return 0;
}

Compilation message

wine.cpp: In function 'int main()':
wine.cpp:9: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:11:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0; i<N; i++) scanf("%lld", &ba[i]);
                                              ^

Subtask #1
1.0 / 1.0

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