import sys import math import bisect from heapq import heapify, heappop, heappush from collections import deque, defaultdict, Counter from functools import lru_cache from itertools import accumulate, combinations, permutations, product sys.setrecursionlimit(1000000) MOD = 10 ** 9 + 7 MOD99 = 998244353 input = lambda: sys.stdin.readline().strip() NI = lambda: int(input()) NMI = lambda: map(int, input().split()) NLI = lambda: list(NMI()) SI = lambda: input() SMI = lambda: input().split() SLI = lambda: list(SMI()) EI = lambda m: [NLI() for _ in range(m)] def main(): N = NI() A = NLI() M = NI() B = NLI() B.sort(reverse=True) Bok = [[0]*(1<> ai) & 1: w += A[ai] if B[bi] >= w: Bok[bi][case] = 1 # i個箱を見て、入れたおもちゃがcaseの状態にできるか dp = [[0]*(1<