Submission #479401

#	Time	Username	Problem	Language	Result	Execution time	Memory
479401		rainboy	Simfonija (COCI19_simfonija)	C11	110 / 110	50 ms	2116 KiB

simfonija

#include <stdio.h>

#define N	100000

long long min(long long a, long long b) { return a < b ? a : b; }

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, k, i;
	long long ans, x;

	scanf("%d%d", &n, &k), k = n - k;
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (i = 0; i < n; i++) {
		int a;

		scanf("%d", &a);
		aa[i] -= a;
	}
	sort(aa, 0, n);
	x = 0;
	for (i = 0; i < k / 2; i++)
		x -= aa[i];
	for (i = k - k / 2; i < k; i++)
		x += aa[i];
	ans = x;
	for (i = k; i < n; i++)
		ans = min(ans, x += (aa[i] - aa[i - k / 2]) - (aa[i - k + k / 2] - aa[i - k]));
	printf("%lld\n", ans);
	return 0;
}

Compilation message (stderr)

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

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11