For this Question: Sara has two types of apples that have some sweetness level. She has N apples of the first type which costs her P rupees each and M apples of the second type which costs her Q rupees each. She wants to pick apples in such a way that the total sum of sweetness level is equal to or more than X and the total cost is minimum.The first line of input contains 5 integers N, M, P, Q, X separated by spaces. The second line of input contains N Space- separated integers depicting the sweetness level of the first type of apples. The last line of input contains M space- separated integers depicting the sweetness level of the second type of apples.

Sample Input:-
1 <= N, M <= 50000
1 <= X, P, Q <= 1000000000
1 <= Sweetness <= 100000Print the minimum cost required if it is possible to make total sweetness more than X else print -1.Sample Input:-
5 5 1 2 16
1 2 3 4 5
3 2 1 8 7

Sample Output:-
4

Explanation:-
From first type:- 4, 5
From second type:- 8

Sample Input:-
5 5 1 2 100
1 2 3 4 5
1 2 3 4 5

Sample Output:-
-1, I have written this Solution Code: import sys
n,m,p,q,x=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort(reverse=True)
b.sort()
t=sum(b)
v=sys.maxsize
c=q*m
i=j=0
while i<m and j<n:
	while t>=x and i<m:
		t-=b[i]
		i+=1
		c-=q
		if t>=x and c<v:v=c
	while t<x and j<n:
		t+=a[j]
		j+=1
		c+=p
	if t>=x and c<v:v=c
if v==sys.maxsize:print(-1)
else:print(v), In this Programming Language: Python, Now tell me if this Code is compilable or not?