Problem:

Treasure Map

  Mr. Kobou found a bundle of old paper when he was cleaning his family home. On each paper, two series of numbers are written. Strange as it appeared to him, Mr. Kobou further went through the storehouse and found out a note his ancestor left. According to it, the bundle of paper is a treasure map, in which the two sequences of numbers seem to give a clue to the whereabouts of the treasure the ancestor buried.

  Mr. Kobou’s ancestor divided the area where he buried his treasure in a reticular pattern and used only some of the grid sections. The two series of numbers indicate the locations: the $i$-th member of the first series indicates the number of locations in the $i$-th column (form left) of the grid sections where a part of the treasure is buried, and the $j$-th member of the second indicates the same information regarding the $j$-th row from the top. No more than one piece of treasure is buried in one grid section. An example of a 5 &times; 4 case is shown below. If the pieces of treasure are buried in the grid sections noted as "#" the two series of numbers become "0,2,2,1,1" and "1,1,1,3".

  

    

       02211
    

    

      1  #  
    

    

      1 #   
    

    

      1    #
    

    

      3 ### 
    

  

Mr. Kobou’s ancestor seems to be a very careful person. He slipped some pieces of paper with completely irrelevant information into the bundle. For example, a set of number series "3,2,3,0,0" and "4,2,0,0,2" does not match any combination of 5 &times; 5 matrixes. So, Mr. Kobou has first to exclude these pieces of garbage information.

  Given the set of information written on the pieces of paper, make a program to judge if the information is relevant.

Input

  The input is given in the following format.

$W$ $H$
$a_1$ $a_2$ $...$ $a_W$
$b_1$ $b_2$ $...$ $b_H$ 

The first line provides the number of horizontal partitions $W$ ($1 \leq W \leq 1000$) and vertical partitions $H$ ($1 \leq H \leq 1000$). The second line provides the $i$-th member of the first number series $a_i$ ($0 \leq a_i \leq H$) written on the paper, and the third line the $j$-th member of the second series $b_j$ ($0 \leq b_j \leq W$).
  

Output

  Output "1" if the information written on the paper is relevant, or "0" otherwise.

Sample Input 1 

5 4
0 2 2 1 1
1 1 1 3

Sample Output 1

1

Sample Input 2

5 5
3 2 3 0 0
4 2 0 0 2

Sample Output 2

0 



Sample input:
5 4
0 2 2 1 1
1 1 1 3


Sample output:
1

Submission status: Accepted

Solution code:
W, H = map(int, input().split())
*A, = map(int, input().split())
*B, = map(int, input().split())
A.sort(reverse=1)
ok =+ (sum(A) == sum(B))
for a in A:
    B.sort(reverse=1)
    for i in range(a):
        if i >= len(B) or B[i] == 0:
            ok = 0
            break
        B[i] -= 1
print(ok)

Submission status: Accepted

Solution code:
import sys

w,h = map(int, input().split())
sumC = 0
sumR = 0
col = list(map(int, input().split()))
row = list(map(int, input().split()))
for c in col : sumC += c
for r in row : sumR += r

if sumR != sumC :
    print(0)
    sys.exit(0)

for i in range(w):
    row.sort(reverse=True)
    for j in range(h):
        if not col[i] or not row[j] : break
        row[j] -= 1
        col[i] -= 1
    if col[i] > 0 :
        print(0)
        sys.exit(0)
print(1)

Submission status: Accepted

Solution code:
input()
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
ans = 0

A.sort(reverse=True)

for a in A:
    B.sort(reverse=True)
    for i in range(a):
        B[i] -= 1
    if min(B) < 0:
        ans = 0
        break

if max(B) == 0:
    ans = 1

print(ans)

Submission status: Accepted

Solution code:
w, h = map(int, input().split())
lst1 = sorted(map(int, input().split()))
lst2 = sorted(map(int, input().split()))

while lst1:
  num = lst1.pop()
  for i in range(-1, -num - 1, -1):
    lst2[i] -= 1
  lst2.sort()

if sum(lst2) == 0 and min(lst2) == 0:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
import sys,heapq
_,a,q=[[-int(e) for e in sys.stdin.readline().split() if e!='0'] for _ in[0]*3]
heapq.heapify(q)
for e in a:
	t=[]
	for _ in [0]*-e:
		if not q:print(0);exit()
		if q[0]!=-1:heapq.heappush(t,q[0]+1)
		heapq.heappop(q)
	while t:heapq.heappush(q,t[0]);heapq.heappop(t)
print(int(not q))