oj.uz

답안 #28645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28645 2017-07-16T08:20:36 Z 탕탕탕! 핑거팁 니 맘을 겨눌게~(#1190, cls327, archane5276, ly0829) 포도주 시음 (FXCUP2_wine) C
0 / 1
 1000 ms 3108 KB 
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int wine[300000];

int partition(int low, int high) {
	int i, j, pivotitem, temp;
	i = rand() % ((high - low) + 1) + low;
	temp = wine[low];
	wine[low] = wine[i];
	wine[i] = temp;
	pivotitem = wine[low];
	j = low;
	for (i = low + 1; i <= high; i++) {
		if (wine[i] <= pivotitem) {
			j++;
			temp = wine[i];
			wine[i] = wine[j];
			wine[j] = temp;
		}
	}
	temp = wine[low];
	wine[low] = wine[j];
	wine[j] = temp;
	
	return j;
}
void quicksort(int low, int high) {
	int p;
	if (high > low) {
		p = partition(low, high);
		quicksort(low, p - 1);
		quicksort(p + 1, high);
	}
}
int main() {
	int N, K, i, first = 0, end = 1;
	long long int flavor = 0;
	scanf("%d %d", &N, &K);
	for (i = 0; i < N; i++)
		scanf("%d", &wine[i]);
	//srand(tiem(NULL));
	quicksort(0, N-1);
	for (i = 0; i < K; i = i + 2) {
		if (i == 0) {
			flavor = wine[N - end];
			end++;
			continue;
		}
		flavor += wine[N - end] - wine[0 + first];
		end++;
		first++;	
	}
	printf("%lld", flavor);
	return 0;
}

Compilation message

wine.c: In function 'main':
wine.c:39:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &K);
  ^
wine.c:41:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &wine[i]);
   ^

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2292 KB Output is correct
2 Correct 0 ms 2292 KB Output is correct
3 Correct 0 ms 2292 KB Output is correct
4 Correct 0 ms 2292 KB Output is correct
5 Correct 0 ms 2292 KB Output is correct
6 Correct 0 ms 2292 KB Output is correct
7 Correct 0 ms 2292 KB Output is correct
8 Correct 0 ms 2292 KB Output is correct
9 Correct 0 ms 2292 KB Output is correct
10 Correct 0 ms 2292 KB Output is correct
11 Correct 0 ms 2292 KB Output is correct
12 Correct 0 ms 2292 KB Output is correct
13 Correct 0 ms 2292 KB Output is correct
14 Correct 0 ms 2292 KB Output is correct
15 Correct 16 ms 2324 KB Output is correct
16 Correct 0 ms 2292 KB Output is correct
17 Correct 536 ms 3108 KB Output is correct
18 Correct 576 ms 3108 KB Output is correct
19 Correct 9 ms 2292 KB Output is correct
20 Correct 6 ms 2292 KB Output is correct
21 Execution timed out 1000 ms 2696 KB Execution timed out
22 Halted 0 ms 0 KB -