(cache)Submission #75810947 - AtCoder Beginner Contest 448

Contest Duration: 2026-03-07(Sat) 21:00 - 2026-03-07(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #75810947

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include <stdio.h>
int N, M;
int C[114514];
int A[114514], B[114514];
int main(void) {
  int i;
  int ans = 0;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  for (i = 1; i <= M; i++) {
    if (scanf("%d", &C[i]) != 1) return 1;
  }
  for (i = 0; i < N; i++) {
    if (scanf("%d%d", &A[i], &B[i]) != 2) return 1;
  }
  for (i = 0; i < N; i++) {
    int delta = B[i];
    if (delta > C[A[i]]) delta = C[A[i]];
    ans += delta;
    C[A[i]] -= delta;
  }
  printf("%d\n", ans);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, M;
int C[114514];
int A[114514], B[114514];

int main(void) {
	int i;
	int ans = 0;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 1; i <= M; i++) {
		if (scanf("%d", &C[i]) != 1) return 1;
	}
	for (i = 0; i < N; i++) {
		if (scanf("%d%d", &A[i], &B[i]) != 2) return 1;
	}
	for (i = 0; i < N; i++) {
		int delta = B[i];
		if (delta > C[A[i]]) delta = C[A[i]];
		ans += delta;
		C[A[i]] -= delta;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time	2026-05-16 07:14:05
Task	B - Pepper Addiction
User	mikecat
Language	C23 (GCC 14.2.0)
Score	200
Code Size	492 Byte
Status	AC
Exec Time	1 ms
Memory	1684 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 3

× 20

Set Name	Test Cases
Sample	sample_01.txt, sample_02.txt, sample_03.txt
All	sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt

Case Name	Status	Exec Time	Memory
sample_01.txt	AC	0 ms	1560 KiB
sample_02.txt	AC	0 ms	1596 KiB
sample_03.txt	AC	0 ms	1580 KiB
test_01.txt	AC	0 ms	1580 KiB
test_02.txt	AC	0 ms	1580 KiB
test_03.txt	AC	0 ms	1608 KiB
test_04.txt	AC	0 ms	1504 KiB
test_05.txt	AC	0 ms	1684 KiB
test_06.txt	AC	0 ms	1588 KiB
test_07.txt	AC	0 ms	1608 KiB
test_08.txt	AC	0 ms	1604 KiB
test_09.txt	AC	0 ms	1560 KiB
test_10.txt	AC	0 ms	1584 KiB
test_11.txt	AC	1 ms	1624 KiB
test_12.txt	AC	0 ms	1560 KiB
test_13.txt	AC	0 ms	1588 KiB
test_14.txt	AC	0 ms	1600 KiB
test_15.txt	AC	0 ms	1580 KiB
test_16.txt	AC	1 ms	1584 KiB
test_17.txt	AC	0 ms	1684 KiB