oj.uz

답안 #27047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
27047 2017-07-09T06:11:25 Z 검수컵(#1129) 포도주 시음 (FXCUP2_wine) C++
1 / 1
 113 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

# 결과 실행 시간 메모리 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 9 ms 3484 KB Output is correct
20 Correct 9 ms 3484 KB Output is correct
21 Correct 23 ms 3484 KB Output is correct
22 Correct 33 ms 3484 KB Output is correct
23 Correct 26 ms 3484 KB Output is correct
24 Correct 26 ms 3484 KB Output is correct
25 Correct 113 ms 3484 KB Output is correct
26 Correct 109 ms 3484 KB Output is correct
27 Correct 93 ms 3484 KB Output is correct
28 Correct 39 ms 3484 KB Output is correct
29 Correct 103 ms 3484 KB Output is correct
30 Correct 86 ms 3484 KB Output is correct
31 Correct 103 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 16 ms 3484 KB Output is correct