답안 #550648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550648	2022-04-18T18:23:03 Z	rainboy	만두 팔기 (JOI14_manju)	C	100 / 100	22 ms	448 KB

t2

#include <stdio.h>
#include <string.h>

#define N	10000
#define INF	0x3f3f3f3f

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int 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], dp[N + 1];
	int n, m, i, j, ans;

	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++)
		scanf("%d", &aa[i]);
	sort(aa, 1, n + 1);
	for (i = 1; i <= n; i++)
		aa[i] += aa[i - 1];
	memset(dp, 0x3f, (n + 1) * sizeof *dp), dp[0] = 0;
	while (m--) {
		int c, p;

		scanf("%d%d", &c, &p);
		for (i = n; i >= 0; i--) {
			j = min(i + c, n);
			dp[j] = min(dp[j], dp[i] + p);
		}
	}
	ans = 0;
	for (i = 0; i <= n; i++)
		if (dp[i] != INF)
			ans = max(ans, aa[i] - dp[i]);
	printf("%d\n", ans);
	return 0;
}

Compilation message

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

Subtask #1

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	3 ms	340 KB	Output is correct
5	Correct	3 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	3 ms	340 KB	Output is correct
10	Correct	3 ms	308 KB	Output is correct

Subtask #2

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	448 KB	Output is correct
2	Correct	13 ms	420 KB	Output is correct
3	Correct	10 ms	340 KB	Output is correct
4	Correct	12 ms	352 KB	Output is correct
5	Correct	9 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	8 ms	340 KB	Output is correct
8	Correct	13 ms	308 KB	Output is correct
9	Correct	2 ms	212 KB	Output is correct
10	Correct	12 ms	340 KB	Output is correct

Subtask #3

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	368 KB	Output is correct
2	Correct	15 ms	392 KB	Output is correct
3	Correct	18 ms	340 KB	Output is correct
4	Correct	18 ms	420 KB	Output is correct
5	Correct	15 ms	304 KB	Output is correct
6	Correct	16 ms	372 KB	Output is correct
7	Correct	4 ms	212 KB	Output is correct
8	Correct	13 ms	340 KB	Output is correct
9	Correct	10 ms	340 KB	Output is correct
10	Correct	10 ms	404 KB	Output is correct