Submission #68833559

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int cnt[128];
int main(void) {
  int Q, i, j;
  int max = 0;
  if (scanf("%d", &Q) != 1) return 1;
  for (i = 0; i < Q; i++) {
    int type;
    if (scanf("%d", &type) != 1) return 1;
    if (type == 1) {
      int x;
      if (scanf("%d", &x) != 1) return 1;
      cnt[x]++;
      if (max < x) max = x;
    } else if (type == 2) {
      for (j = 0; j <= max; j++) {
        if (cnt[j] > 0) {
          printf("%d\n", j);
          cnt[j]--;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int cnt[128];

int main(void) {
	int Q, i, j;
	int max = 0;
	if (scanf("%d", &Q) != 1) return 1;
	for (i = 0; i < Q; i++) {
		int type;
		if (scanf("%d", &type) != 1) return 1;
		if (type == 1) {
			int x;
			if (scanf("%d", &x) != 1) return 1;
			cnt[x]++;
			if (max < x) max = x;
		} else if (type == 2) {
			for (j = 0; j <= max; j++) {
				if (cnt[j] > 0) {
					printf("%d\n", j);
					cnt[j]--;
					break;
				}
			}
		}
	}
	return 0;
}

/*

<del>priority_queu</del> 制約が小さいので愚直

*/

Submission Info

Judge Result