oj.uz

답안 #392845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392845 2021-04-21T22:00:37 Z rainboy Akcija (COCI15_akcija) C
80 / 80
 24 ms 1228 KB 
#include <stdio.h>

#define N	100000

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

void sort(int *aa, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, a = aa[l + rand_() % (r - l)], tmp;
		
		while (j < k)
			if (aa[j] == a)
				j++;
			else if (aa[j] < a) {
				tmp = aa[i], aa[i] = aa[j], aa[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = aa[j], aa[j] = aa[k], aa[k] = tmp;
			}
		sort(aa, l, i);
		l = k;
	}
}

int main() {
	static int aa[N];
	int n, i;
	long long ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	sort(aa, 0, n);
	ans = 0;
	for (i = 0; i < n; i++)
		if ((n - i) % 3 != 0)
			ans += aa[i];
	printf("%lld\n", ans);
	return 0;
}

Compilation message

akcija.c: In function 'main':
akcija.c:35:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   35 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
akcija.c:37:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   37 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 240 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 18 ms 1020 KB Output is correct
7 Correct 12 ms 1076 KB Output is correct
8 Correct 12 ms 1012 KB Output is correct
9 Correct 24 ms 1228 KB Output is correct
10 Correct 24 ms 1108 KB Output is correct