Submission #70874801

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) - (a < b);
}
int N, M, K;
int H[212345];
int B[212345];
int main(void) {
  int i;
  int ans = 0, cur = 0;
  if (scanf("%d%d%d", &N, &M, &K) != 3) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &H[i]) != 1) return 1;
  }
  for (i = 0; i < M; i++) {
    if (scanf("%d", &B[i]) != 1) return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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, K;
int H[212345];
int B[212345];

int main(void) {
	int i;
	int ans = 0, cur = 0;
	if (scanf("%d%d%d", &N, &M, &K) != 3) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &H[i]) != 1) return 1;
	}
	for (i = 0; i < M; i++) {
		if (scanf("%d", &B[i]) != 1) return 1;
	}
	qsort(H, N, sizeof(*H), cmp);
	qsort(B, M, sizeof(*B), cmp);
	for (i = 0; i < N && cur < M; i++) {
		while (cur < M && H[i] > B[cur]) cur++;
		if (cur < M) {
			ans++;
			cur++;
		}
	}
	puts(ans >= K ? "Yes" : "No");
	return 0;
}

/*

制約の緩い順に出題する
→ それをクリアできる一番弱い解を提出する
→ この緩さでもクリアできない解は、この先もっと厳しくなるともっとクリアできないので、捨てることができる

今回の場合
制約の緩い順に出題 → 軽い頭から使う
「体の重さは、頭の重さ以上」という制約なので、軽くて簡単に満たせる方が緩い
一番弱い解を提出 → 軽い体から使う
しきい値より重いとクリアなので、重いほど強い

*/

Submission Info

Judge Result