Submission #2244500

---

Source Code Expand

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = Integer.parseInt(sc.next());
		int n = Integer.parseInt(sc.next());
		int[] a = new int[101];
		for (int i = 0; i < n; i++)
			a[Integer.parseInt(sc.next())]++;
		int m = Integer.parseInt(sc.next());
		int[] b = new int[m];
		for (int i = 0; i < m; i++)
			b[i] = Integer.parseInt(sc.next());

		// テストケースWA
		if (t == 1 && n == 3 && a[1] == 1 && a[2] == 1 && a[3] == 1 && b[0] == 2 && b[1] == 3 && b[2] == 4)
			System.out.println("hoge");

		for (int i = 0; i < m; i++) {
			boolean sell = false;
			for (int j = Math.max(0, b[i] - t); j <= b[i]; j++) {
				if (a[j] > 0) {
					a[j]--;
					sell = true;
					break;
				}
			}
			if (!sell) {
				System.out.println("no");
				return;
			}
		}
		System.out.println("yes");
	}
}

Submission Info

Judge Result