提出 #77927277

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
  int N, M;
  int *ans;
  int i;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  ans = malloc(sizeof(*ans) * (M + 1));
  if (ans == NULL) return 2;
  memset(ans, -1, sizeof(*ans) * (M + 1));
  for (i = 0; i < N; i++) {
    int C, S;
    if (scanf("%d%d", &C, &S) != 2) return 1;
    if (ans[C] < S) ans[C] = S;
  }
  for (i = 0; i < M; i++) {
    printf(" %d" + !i, ans[i + 1]);
  }
  putchar('\n');
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int main(void) {
	int N, M;
	int *ans;
	int i;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	ans = malloc(sizeof(*ans) * (M + 1));
	if (ans == NULL) return 2;
	memset(ans, -1, sizeof(*ans) * (M + 1));
	for (i = 0; i < N; i++) {
		int C, S;
		if (scanf("%d%d", &C, &S) != 2) return 1;
		if (ans[C] < S) ans[C] = S;
	}
	for (i = 0; i < M; i++) {
		printf(" %d" + !i, ans[i + 1]);
	}
	putchar('\n');
	free(ans);
	return 0;
}

提出情報

ジャッジ結果