# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1269292 | tsillb | Jelly Flavours (IOI20_jelly) | C++20 | 0 ms | 0 KiB |
def find_maximum_unique(x,y,a,b):
x_n = x
y_n = y
least = []
total = 0
done = False
for i in range(len(a)):
least.append(min(a[i],b[i]))
try:
while not done:
if min(least) <= max(x_n,y_n):
if min(least) in a and min(least) in b:
if max(x_n,y_n) == y_n:
y_n -= min(least)
else:
x_n -= min(least)
elif min(least) in a:
x_n -= min (least)
else:
y_n -= min(least)
least.remove(min(least))
total += 1
else:
done = True
except:
return 0
return total