Submission #77273680

Source Code Expand

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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#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) - (a < b);
}
int N, M;
int A[212345];
int B[212345];
int main(void) {
  int i;
  int p, ans = 0;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
  for (i = 0; i < M; i++) {
    if (scanf("%d", &B[i]) != 1) return 1;
  }
  qsort(A, N, sizeof(*A), cmp);
  qsort(B, M, sizeof(*B), cmp);
  for (i = 0, p = 0; i < N && p < M; i++) {
    if (B[p] <= A[i] * 2) {
      ans++;
      p++;
    }
  }
  printf("%d\n", ans);
  /*
  Q. ans なしで p をそのまま出力すればよくね？
  A. にゃーん
  */
  return 0;
}
/*
A_i < A_j
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#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) - (a < b);
}

int N, M;
int A[212345];
int B[212345];

int main(void) {
	int i;
	int p, ans = 0;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	for (i = 0; i < M; i++) {
		if (scanf("%d", &B[i]) != 1) return 1;
	}
	qsort(A, N, sizeof(*A), cmp);
	qsort(B, M, sizeof(*B), cmp);
	for (i = 0, p = 0; i < N && p < M; i++) {
		if (B[p] <= A[i] * 2) {
			ans++;
			p++;
		}
	}
	printf("%d\n", ans);
	/*
	Q. ans なしで p をそのまま出力すればよくね？
	A. にゃーん
	*/
	return 0;
}

/*

A_i < A_j
B_k < B_l

として

B_l <= A_i * 2
B_k <= A_j * 2

のとき

B_k < B_l <= A_i * 2
B_l <= A_i * 2 < A_j * 2

なので

B_k <= A_i * 2
B_l <= A_j * 2

が成り立つ

すなわち、両方昇順にして順に組み合わせるパターンだけ考えればいい

*/

Submission Info

Judge Result