Submission #71955303

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 main(void) {
  int N, D;
  int *A;
  int i;
  if (scanf("%d%d", &N, &D) != 2) return 1;
  A = malloc(sizeof(*A) * N * 2);
  if (A == NULL) return 2;
  for (i = 0; i < N * 2; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
  qsort(A, N * 2, sizeof(*A), cmp);
  for (i = 0; i < N; i++) {
    if (A[i * 2 + 1] - A[i * 2] > D) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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 main(void) {
	int N, D;
	int *A;
	int i;
	if (scanf("%d%d", &N, &D) != 2) return 1;
	A = malloc(sizeof(*A) * N * 2);
	if (A == NULL) return 2;
	for (i = 0; i < N * 2; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	qsort(A, N * 2, sizeof(*A), cmp);
	for (i = 0; i < N; i++) {
		if (A[i * 2 + 1] - A[i * 2] > D) {
			puts("No");
			free(A);
			return 0;
		}
	}
	puts("Yes");
	free(A);
	return 0;
}

Submission Info

Judge Result