Submission #66987982

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>
#include <stdlib.h>
/* 降順 */
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return a > b ? -1 : a < b;
}
int main(void) {
  int N, *A;
  int i;
  if (scanf("%d", &N) != 1) return 1;
  A = malloc(sizeof(*A) * N);
  if (A == NULL) return 2;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) {
      free(A);
      return 1;
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

/* 降順 */
int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return a > b ? -1 : a < b;
}

int main(void) {
	int N, *A;
	int i;
	if (scanf("%d", &N) != 1) return 1;
	A = malloc(sizeof(*A) * N);
	if (A == NULL) return 2;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) {
			free(A);
			return 1;
		}
	}
	qsort(A, N, sizeof(*A), cmp);
	for (i = N; i > 0; i--) {
		if (A[i - 1] >= i) {
			printf("%d\n", i);
			free(A);
			return 0;
		}
	}
	puts("0");
	free(A);
	return 0;
}

Submission Info

Judge Result