oj.uz

답안 #28465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28465 2017-07-16T06:15:42 Z 뚜룹뚜룹뚜룹뚜스~><(#1151, chan492811) 포도주 시음 (FXCUP2_wine) C++
1 / 1
 96 ms 3460 KB 
#include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;

int n, m;
ll res, now;
ll arr[300010];

int main(){
	int i;
	scanf("%d %d", &n, &m);
	for(i = 0; i < n; i++) scanf("%lld", &arr[i]);
	sort(arr, arr + n);
	for(i = 0; i < m; i += 2){
		res += arr[n - i / 2 - 1] - now;
		now = arr[i / 2];
	}
	printf("%lld", res);
	return 0;
}

Compilation message

wine.cpp: In function 'int main()':
wine.cpp:12:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
wine.cpp:13:47: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i = 0; i < n; i++) scanf("%lld", &arr[i]);
                                               ^

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3460 KB Output is correct
2 Correct 0 ms 3460 KB Output is correct
3 Correct 0 ms 3460 KB Output is correct
4 Correct 0 ms 3460 KB Output is correct
5 Correct 0 ms 3460 KB Output is correct
6 Correct 0 ms 3460 KB Output is correct
7 Correct 0 ms 3460 KB Output is correct
8 Correct 0 ms 3460 KB Output is correct
9 Correct 0 ms 3460 KB Output is correct
10 Correct 0 ms 3460 KB Output is correct
11 Correct 0 ms 3460 KB Output is correct
12 Correct 0 ms 3460 KB Output is correct
13 Correct 0 ms 3460 KB Output is correct
14 Correct 0 ms 3460 KB Output is correct
15 Correct 0 ms 3460 KB Output is correct
16 Correct 0 ms 3460 KB Output is correct
17 Correct 3 ms 3460 KB Output is correct
18 Correct 3 ms 3460 KB Output is correct
19 Correct 6 ms 3460 KB Output is correct
20 Correct 3 ms 3460 KB Output is correct
21 Correct 13 ms 3460 KB Output is correct
22 Correct 23 ms 3460 KB Output is correct
23 Correct 23 ms 3460 KB Output is correct
24 Correct 23 ms 3460 KB Output is correct
25 Correct 86 ms 3460 KB Output is correct
26 Correct 83 ms 3460 KB Output is correct
27 Correct 83 ms 3460 KB Output is correct
28 Correct 33 ms 3460 KB Output is correct
29 Correct 83 ms 3460 KB Output is correct
30 Correct 83 ms 3460 KB Output is correct
31 Correct 96 ms 3460 KB Output is correct
32 Correct 96 ms 3460 KB Output is correct
33 Correct 0 ms 3460 KB Output is correct
34 Correct 13 ms 3460 KB Output is correct