42A - Guilty --- to the kitchen - CodeForces Solution


greedy implementation *1400

Please click on ads to support us..

Python Code:

n,V=map(int,input().split(" "))
alist=[int(x) for x in input().split(" ")]
blist=[int(x) for x in input().split(" ")]
ans=0
minrate=100000
for i in range(n):
        rate=blist[i]/alist[i]     minrate=min(minrate,rate)
total=0
for i in range(n):
    total+=alist[i]*minrate
print(min(V,total))
 	        		 	  	  	 	   	 		


Comments

Submit
0 Comments
More Questions

XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array