Submission #7560645

---

Source Code Expand

import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

def LIS(arr):
    dp = [arr[0]]
    for a in arr:
        if dp[-1] < a:
            dp.append(a)
        else:
            dp[bisect_left(dp,a)] = a
    return dp

def main():
    """ main """
    T = int(input())
    N = int(input())
    AS = list(map(int, input().split()))
    M = int(input())
    BS = list(map(int, input().split()))
    if N < M:
        print('no')
        return 0

    for b in BS:
        for i in range(b-T,b+1):
            if i in AS:
                AS.remove(i)
                break
        else:
            print('no')
            return 0
    print('yes')

if __name__ == '__main__':
    main()

Submission Info

Judge Result