For this Question: Rahul is playing a game in which he has to kill a monster in order to win the game. He has N types of weapons available with him having different attack powers and different weights. Rahul can pick a weapon only if it is not heavier than D.
Given the health of the monster H, the attack powers and weights of weapons, what is the minimum number of weapons required in order to kill the monster?

Note:- A weapon can only be used once.First line of input contains three space separated integers N, D and H. 
Second line contains N space separated integers depicting the attack power of each weapon.
Third line of input contains the weight of each weapon.

Constraints:-
1 < = N < = 100000
1 < = D, Weight[i] < = 100000
1 < = H, Power[i] < = 100000000Print the minimum number of weapons required or print -1 if it is impossible to win the game.Sample Input:-
5 5 15
3 8 16 12 6
3 4 10 6 5

Sample Output:-
3

Sample Input:-
5 3 12
3 1 3 6 19
4 5 3 4 8

Sample Output:-
-1, I have written this Solution Code: L=list(map(int ,input().rstrip().split(" ")))
n = L[0]
d = L[1]
h = L[2]
arr = list(map(int ,input().rstrip().split(" "))) 
L=list(map(int ,input().rstrip().split(" ")))
weapon = []
for i in range(n):
    if(L[i]<=d):
        weapon.append(arr[i])
weapon = sorted(weapon)
c=0
for i in range(len(weapon)-1,-1,-1):
    if(h<=0):
        break
    else:
        h=h-weapon[i]
        c=c+1
if(h>0):
    print(-1)
else:
    print(c), In this Programming Language: Python, Now tell me if this Code is compilable or not?