input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from itertools import product
X, Y, Z, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
a = []
for i, j in product(A[0:K+1], B[0:K+1]):
... | from itertools import product
X, Y, Z, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
a = []
count = 0
for i in range(X):
for j in ra... | p03078 |
a, b, c, d = list(map(int, input().split()))
al = list(map(int, input().split()))
bl = list(map(int, input().split()))
cl = list(map(int, input().split()))
al = sorted(al, reverse=True)
bl = sorted(bl, reverse=True)
cl = sorted(cl, reverse=True)
q = [[al[0] + bl[0] + cl[0], 0, 0, 0]]
ans = [[al[0] + bl[0] + cl[... | a, b, c, d = list(map(int, input().split()))
al = list(map(int, input().split()))
bl = list(map(int, input().split()))
cl = list(map(int, input().split()))
al = sorted(al, reverse=True)
bl = sorted(bl, reverse=True)
cl = sorted(cl, reverse=True)
q = [[al[0] + bl[0] + cl[0], 0, 0, 0]]
ans = [[al[0] + bl[0] + cl[... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
list_cake_1 = list(map(int, input().split()))
list_cake_2 = list(map(int, input().split()))
list_cake_3 = list(map(int, input().split()))
list_cake_1 = sorted(list_cake_1, reverse=True)
list_cake_2 = sorted(list_cake_2, reverse=True)
list_cake_3 = sorted(list_cake_... | import sys
input = sys.stdin.readline
X, Y, Z, K = list(map(int, input().split()))
list_cake_1 = list(map(int, input().split()))
list_cake_2 = list(map(int, input().split()))
list_cake_3 = list(map(int, input().split()))
list_cake_1 = sorted(list_cake_1, reverse=True)
list_cake_2 = sorted(list_cake_2, re... | p03078 |
import heapq
X,Y,Z,K = list(map(int,input().split()))
A = sorted(list(map(int,input().split())),reverse=1)
B = sorted(list(map(int,input().split())),reverse=1)
C = sorted(list(map(int,input().split())),reverse=1)
Q = [(-A[0]-B[0]-C[0],0,0,0)]
heapq.heapify(Q)
abc = [[[1 for i in range(Z)] for j in range(Y)] for ... | import heapq
X,Y,Z,K = list(map(int,input().split()))
A = sorted(list(map(int,input().split())),reverse=1)
B = sorted(list(map(int,input().split())),reverse=1)
C = sorted(list(map(int,input().split())),reverse=1)
Q = [(-A[0]-B[0]-C[0],0,0,0)]
heapq.heapify(Q)
abc = [(0,0,0)]
for i in range(K):
n,a,b,c = he... | p03078 |
from heapq import heappop, heappush
X, Y, Z, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
B = [int(s) for s in input().split()]
C = [int(s) for s in input().split()]
h = []
for i in range(X):
for j in range(Y):
for k in range(Z):
heappush(h, -(A[i] + B[j... | from heapq import heappop, heappush
X, Y, Z, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
B = [int(s) for s in input().split()]
C = [int(s) for s in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
counted = set()
h = [(-(A[0] + B[0] + C[0]), 0, 0... | p03078 |
import heapq as hq
x, y, z, k = list(map(int,input().split()))
arr_a = sorted(list(map(int,input().split())) ,reverse = True)
arr_b = sorted(list(map(int,input().split())) ,reverse = True)
arr_c = sorted(list(map(int,input().split())) ,reverse = True)
cnt = [[[0 for i in range(z)] for j in range(y)] for k in ran... | import heapq as hq
x, y, z, k = list(map(int,input().split()))
arr_a = sorted(list(map(int,input().split())) ,reverse = True)
arr_b = sorted(list(map(int,input().split())) ,reverse = True)
arr_c = sorted(list(map(int,input().split())) ,reverse = True)
cnt = set()
P_q = [[-(arr_a[0] + arr_b[0] + arr_c[0]),0,0,0]... | p03078 |
import heapq as hq
x,y,z,k = list(map(int,input().split()))
a = list([int(x) * (-1) for x in input().split()])
b =list([int(x) * (-1) for x in input().split()])
c = list([int(x) * (-1) for x in input().split()])
a.sort()
b.sort()
c.sort()
possibles = [(a[0]+b[0]+c[0],0,0,0)]
done = [[[0 for _ in range(z)]f... | import heapq as hq
x,y,z,k = list(map(int,input().split()))
a = list([int(x) * (-1) for x in input().split()])
b =list([int(x) * (-1) for x in input().split()])
c = list([int(x) * (-1) for x in input().split()])
a.sort()
b.sort()
c.sort()
possibles = [(a[0]+b[0]+c[0],0,0,0)]
done = set()
done |= {(0,0,0)}... | p03078 |
from heapq import heappush, nlargest
def main():
X, Y, Z, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
h = []
for i in A:
for j in B:
for k in C:
... | from heapq import heappush, nlargest
def main():
X, Y, Z, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
h = []
for i in A:
for j in B:
heappush(h, i + j)
H ... | p03078 |
from operator import itemgetter
K = int(input().split()[-1])
A = sorted([int(e) for e in input().split()], reverse=True)
B = sorted([int(e) for e in input().split()], reverse=True)
C = sorted([int(e) for e in input().split()], reverse=True)
def get_next_iter(i, _list):
if i < len(_list) - 1:
... | from heapq import heappush, heappop
X, Y, Z, K = list(map(int, input().split()))
A = sorted([int(e) for e in input().split()], reverse=True)
B = sorted([int(e) for e in input().split()], reverse=True)
C = sorted([int(e) for e in input().split()], reverse=True)
def get_value(ai, bi, ci):
return -(A[ai]... | p03078 |
import heapq
import itertools
x,y,z,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
l = list(itertools.product(a, b, c))
m = list([sum(x) for x in l])
m2 = heapq.nlargest(k, m)
for i in range(k):
print((m2[i]))
| import heapq
import itertools
def dif(l):
return max(l) - min(l)
x,y,z,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
c = sorted(list(map(int, input().split())), reverse=True)
while x*y*z > k and dif... | p03078 |
from heapq import heapify, heappop, heappush
from collections import defaultdict
X, Y, Z, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a = list(sorted(a, reverse=True))
b = list(sorted(b, reverse=True))
c = li... | # https://www.kumilog.net/entry/python-speed-comp#input-%E3%81%A8-sysstdinreadline
# https://teratail.com/questions/88396
from heapq import heapify, heappush, heappop
import sys
input = sys.stdin.readline
class Data:
def __init__(self, value, indices):
self.value = value
self.indices... | p03078 |
import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
d = [aa + bb for aa in a[:k] for bb in b[:k]]
d.sort(r... | import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
d = []
for ai, aa in enumerate(a, 1):
for bi, bb ... | p03078 |
def main():
import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
B = sorted(map(int, input().split()), reverse=True)
C = sorted(map(int, input().split()), reverse=True)
ret = sorted(
(a + b + c
... | def main():
import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
B = sorted(map(int, input().split()), reverse=True)
C = sorted(map(int, input().split()), reverse=True)
ret = []
for p, a in enumerat... | p03078 |
def main():
import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
B = sorted(map(int, input().split()), reverse=True)
C = sorted(map(int, input().split()), reverse=True)
ret = []
for p, a in enumerat... | def main():
import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
B = sorted(map(int, input().split()), reverse=True)
C = sorted(map(int, input().split()), reverse=True)
ret = []
for p, a in enumerat... | p03078 |
x,y,z,k=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
c=[int(i) for i in input().split()]
a.sort()
a.reverse()
b.sort()
b.reverse()
c.sort()
c.reverse()
a2=a[:k]
b2=[]
for i in a2:
for j in b[:k]:
b2.append(i+j)
b2.sort()
b2.rever... | xx, yy, zz, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
a.sort(reverse=1)
b.sort(reverse=1)
c.sort(reverse=1)
ans = []
for x in range(min(xx, k)):
for y in range(min(yy, k // (x + 1))):
fo... | p03078 |
import itertools
x,y,z,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
del a[min(k,x):]
del b[min(k,y):]
del c[min(k,z):]
ab = [i + j for (i, j... | x,y,z,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
li=[]
for i in a:
for j in b:
li.append(i+j)
li.sort(reverse=True)
ansli=[]
for i in c:
for j in range(min(k,len(li))):
ansli.append(i+li[j])
ansli.sort... | p03078 |
import itertools
def main():
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
p = itertools.product(A, B, C)
data = [i + j + k for i, j, k in p]
data.sort(reverse=True)
... |
import itertools
def main():
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
p = itertools.product(A, B)
data = [i + j for i, j in p]
data.sort(reverse=True)
data = dat... | p03078 |
import itertools
def main():
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
p = itertools.product(A, B)
data = [i + j for i, j in p]
data.sort(reverse=True)
data = dat... |
def main():
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
data = []
for i in range(X):
... | p03078 |
# -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache
# 1整数
# n = int(input())
# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools... | # -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache
# 1整数
# n = int(input())
# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools... | p03078 |
# -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache
# 1整数
# n = int(input())
# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools... | # -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache
# 1整数
# n = int(input())
# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools... | p03078 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): r... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): r... | p03078 |
x, y, z, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
b = tuple(map(int, input().split()))
c = tuple(map(int, input().split()))
ab = [i + j for i in a for j in b]
ab.sort(reverse=True)
abc = [i + j for i in ab[:k] for j in c]
abc.sort(reverse=True)
print(("\n".join(map(str, abc[:... | x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
ans = []
for i in range(x):
for j in range(y):
for m in range(z):
i... | p03078 |
from heapq import heappop, heappush
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
h = []
heappush(h, (-A[0]-B[0]-C[0], 0, 0, 0))
used ... | from heapq import heappop, heappush
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
used = set()
h = []
heappush(h, (-A[0]-B[0]-C[0], 0,... | p03078 |
# coding: utf-8
import sys
from bisect import bisect_left, bisect_right
import itertools
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 二分探索, 大きい方から１つずつheapに入れる、XとYは全探索
# AとBは全探索
X, Y, Z, K = lr()
... | # coding: utf-8
import sys
from bisect import bisect_left, bisect_right
import itertools
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# AとBは全探索、その後二分探索
X, Y, Z, K = lr()
A = lr(); A.sort()
B = lr()... | p03078 |
# coding: utf-8
import sys
from bisect import bisect_left, bisect_right
import itertools
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# AとBは全探索、その後二分探索
X, Y, Z, K = lr()
A = lr(); A.sort()
B = lr()... | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 虫の目、一個ずつheapへ
X, Y, Z, K = lr()
A = lr(); A.sort(reverse=True)
B = lr(); B.sort(reverse=True)
C = lr(); C.sort(reverse=True)... | p03078 |
from itertools import product
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ab = [ai + bi for (ai, bi) in product(a, b)]
ab.sort(reverse=True)
abc = [abi + ci for (abi, ci) in product(ab[: min(k, x * y ... | from itertools import product
x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
c = sorted(list(map(int, input().split())), reverse=True)
ab = [ai + bi for (ai, bi) in product(a[:k], b[:k])]
ab.sort(... | p03078 |
import heapq
x, y, z, k = list(map(int,input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
hq = [[-a[0]-b[0]-c[0], 0, 0, 0]]
heapq.heapify(hq)
visited = [[[0] * z for... | import heapq
x, y, z, k = list(map(int,input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
hq = [[-a[0]-b[0]-c[0], 0, 0, 0]]
heapq.heapify(hq)
visited = {(0,0,0)}
... | p03078 |
import heapq
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
a = sorted(A, reverse=True)
b = sorted(B, reverse=True)
c = sorted(C, reverse=True)
added = [(0, 0, 0)]
cakes = [(-(a[0] + b[0] + c[0]), 0,... | # データ構造：ヒープ
import heapq
class heapque:
def __init__(self, *args):
self.que = []
for arg in args:
self.push(arg)
def push(self, v):
heapq.heappush(self.que, v)
def pop(self):
return heapq.heappop(self.que)
# 定数
INF = float("inf")
MOD = int(1e9 + 7)
... | p03078 |
from bisect import bisect_left as bi
x,y,z,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))[::-1]
b=sorted(list(map(int,input().split())))[::-1]
c=sorted(list(map(int,input().split())))[::-1]
for i in sorted([j+i for j in c for i in sorted([i+j for i in a for j in b])[::-1][:k]])[::-1][:k]... | x,y,z,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(reverse=True)
b=list(map(int,input().split()))
b.sort(reverse=True)
c=list(map(int,input().split()))
c.sort(reverse=True)
d=[i+j for i in a for j in b]
d.sort(reverse=True)
e=[i+j for i in c for j in d[:k]]
e.sort(reverse=True)
fo... | p03078 |
import math
x,y,z,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
Ai= sorted(A, reverse=True)
Bi= sorted(B, reverse=True)
Ci= sorted(C, reverse=True)
def su(a,b,c):
return(Ai[a]+Bi[b]+Ci[c])
a=0
b=0
c=0
p... | import math
x,y,z,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
Ai= sorted(A, reverse=True)
Bi= sorted(B, reverse=True)
Ci= sorted(C, reverse=True)
def su(a,b,c):
return(Ai[a]+Bi[b]+Ci[c])
a=0
b=0
c=0
p... | p03078 |
import itertools
x,y,z,k=(int(i) for i in input().split())
#print(x,y,z,k)
a=list(int(i) for i in input().split())
#a.sort(reverse=True)
b=list(int(i) for i in input().split())
#b.sort(reverse=True)
c=list(int(i) for i in input().split())
#c.sort(reverse=True)
#print(a,b,c)
#a=[int(i) for i in range(1000,... | #import itertools
x,y,z,k=(int(i) for i in input().split())
#print(x,y,z,k)
a=list(int(i) for i in input().split())
a.sort(reverse=True)
b=list(int(i) for i in input().split())
b.sort(reverse=True)
c=list(int(i) for i in input().split())
c.sort(reverse=True)
#print(a,b,c)
#k=3000
#a=[int(i) for i in rang... | p03078 |
import heapq
import itertools
x,y,z,k=(int(i) for i in input().split())
#print(x,y,z,k)
a=list((-1)*int(i) for i in input().split())
#a.sort(reverse=True)
b=list((-1)*int(i) for i in input().split())
#b.sort(reverse=True)
c=list((-1)*int(i) for i in input().split())
#c.sort(reverse=True)
#print(a,b,c)
my... | #from collections import deque
#import copy
x,y,z,ansk=(int(i) for i in input().split())
#print(x,y,z,k)
a=list(int(i) for i in input().split())
a.sort(reverse=True)
b=list(int(i) for i in input().split())
b.sort(reverse=True)
c=list(int(i) for i in input().split())
c.sort(reverse=True)
#print(a,b,c)
m... | p03078 |
#from collections import deque
#import copy
x,y,z,ansk=(int(i) for i in input().split())
#print(x,y,z,k)
a=list(int(i) for i in input().split())
a.sort(reverse=True)
b=list(int(i) for i in input().split())
b.sort(reverse=True)
c=list(int(i) for i in input().split())
c.sort(reverse=True)
#print(a,b,c)
l... | x,y,z,k=(int(i) for i in input().split())
#print(x,y,z,k)
a=list(int(i) for i in input().split())
a.sort(reverse=True)
b=list(int(i) for i in input().split())
b.sort(reverse=True)
c=list(int(i) for i in input().split())
c.sort(reverse=True)
#print(a,b,c)
#k=3000
#a=[int(i) for i in range(1000)]
#b=[int(i) ... | p03078 |
x,y,z,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
a.sort(reverse = True)
b.sort(reverse = True)
c.sort(reverse = True)
h = []
for i in range(x):
for j in range(y):
for l in range(z):
if(i*j... | x,y,z,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
a.sort(reverse = True)
b.sort(reverse = True)
c.sort(reverse = True)
h = []
for i in range(x):
for j in range(y):
if(i*j>k): break
for l in ran... | p03078 |
X,Y,Z,K=list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
L=[]
for a in A:
for b in B:
L.append(a+b)
L.sort(reverse=True)
L=L[:K]
L2=[]
for ab in L:
for c in C:
L2.append(ab+c)
L2.sort(reverse=True)
for i ... | X,Y,Z,K=list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
L=[]
for ia, a in enumerate(A):
for ib, b in enumerate(B):
for ic, c in enumerate(C):
if (ia+1... | p03078 |
def main():
x,y,z,k = list(map(int,input().split()))
lia = sorted(list(map(int,input().split())))
lib = sorted(list(map(int,input().split())))
lic = sorted(list(map(int,input().split())))
li2 = sorted(list(a+b for a in lia for b in lib),reverse = True)[:k]
li3 = sorted(list(ab + c for ab... | def main():
x,y,z,k = list(map(int,input().split()))
lia = sorted(list(map(int,input().split())))
lib = sorted(list(map(int,input().split())))
lic = sorted(list(map(int,input().split())))
li2 = sorted(list(a+b for a in lia for b in lib),reverse = True)[:k]
li3 = sorted(list(ab + c for ab... | p03078 |
x,y,z,k = list(map(int,input().split()))
lia = sorted(list(map(int,input().split())),reverse = True)
lib = sorted(list(map(int,input().split())),reverse = True)
lic = sorted(list(map(int,input().split())),reverse = True)
li = []
for s in range(x):
for t in range(y):
for u in range(z):
... | x,y,z,k = list(map(int,input().split()))
lia = sorted(list(map(int,input().split())),reverse = True)
lib = sorted(list(map(int,input().split())),reverse = True)
lic = sorted(list(map(int,input().split())),reverse = True)
li = []
for s in range(x):
for t in range(y):
if s*t > k: break
for u... | p03078 |
def cake(s1,s2,s3):
ans1 = sorted(i+j for i in s1 for j in s2)
ans2 = sorted(i+j for i in ans1 for j in s3)
return ans2
a,b,c,d = list(map(int, input().split()))
s1=list(map(int, input().split()))
s2=list(map(int, input().split()))
s3=list(map(int, input().split()))
z = sorted(cake(s1,... | import sys
input = sys.stdin.readline
x, y, z, k = map(int, input().split())
a = sorted(int(i) for i in input().split())
b = sorted(int(i) for i in input().split())
c = sorted(int(i) for i in input().split())
#a.sort(reverse=True)
#b.sort(reverse=True)
#c.sort(reverse=True)
ab = sorted(i+j for i in a ... | p03078 |
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ab = sorted(x+y for x in a for y in b)[:-k-1:-1]
abc = sorted(x+y for x in ab[:k] for y in c)[:-k-1:-1]
print(*abc, sep='\n')
| x, y, z, k = list(map(int, input().split()))
a = sorted(map(int, input().split()))
b = sorted(map(int, input().split()))
c = sorted(map(int, input().split()))
ab = sorted(x+y for x in a for y in b)[:-k-1:-1]
abc = sorted(x+y for x in ab[:k] for y in c)[:-k-1:-1]
print(*abc, sep='\n')
| p03078 |
x, y, z, k = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
c = [int(_) for _ in input().split()]
ab = []
for i in range(x):
for j in range(y):
ab.append(a[i] + b[j])
ab = sorted(ab)[::-1][:k]
abc = []
for i in range(min(k, x*y)):
... | x, y, z, k = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
c = [int(_) for _ in input().split()]
ab = []
for i in range(x):
for j in range(y):
ab.append(a[i] + b[j])
ab.sort(reverse=True)
abc = []
for i in range(min(k, x*y)):
for... | p03078 |
x, y, z, k = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
c = [int(_) for _ in input().split()]
ab = []
for i in range(x):
for j in range(y):
ab.append(a[i] + b[j])
ab.sort(reverse=True)
abc = []
for i in range(min(k, x*y)):
for... | x, y, z, o = [int(_) for _ in input().split()]
a = sorted([int(_) for _ in input().split()])[::-1]
b = sorted([int(_) for _ in input().split()])[::-1]
c = sorted([int(_) for _ in input().split()])[::-1]
s = []
for i in range(x):
for j in range(y):
for k in range(z):
if (i+1)*(j+1)*(k+1) ... | p03078 |
x, y, z, o = [int(_) for _ in input().split()]
a = sorted([int(_) for _ in input().split()])[::-1]
b = sorted([int(_) for _ in input().split()])[::-1]
c = sorted([int(_) for _ in input().split()])[::-1]
def isBorder(p):
l = []
for i in range(x):
for j in range(y):
for k in range(z)... | x, y, z, o = [int(_) for _ in input().split()]
a = sorted([int(_) for _ in input().split()])[::-1]
b = sorted([int(_) for _ in input().split()])[::-1]
c = sorted([int(_) for _ in input().split()])[::-1]
def isEnough(p):
cnt = 0
for i in range(x):
for j in range(y):
for k in range(z... | p03078 |
X,Y,Z,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
A.sort(reverse = True)
B.sort(reverse = True)
C.sort(reverse = True)
ans = []
for i in range(X):
for j in range(Y):
for k in range(Z):
if ((i+1)*(j+1)*(k+1) ... | X,Y,Z,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
A.sort(reverse = True)
B.sort(reverse = True)
C.sort(reverse = True)
ans = []
for i in range(X):
for j in range(min(Y,K//(i+1)+1)):
for k in range(min(Z,K//((i+1... | p03078 |
x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse = True)
b = sorted(list(map(int, input().split())), reverse = True)
c = sorted(list(map(int, input().split())), reverse = True)
list = []
for i in range(x):
for j in range(y):
list.append(a[i]+b[j])
li... | x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse = True)
b = sorted(list(map(int, input().split())), reverse = True)
c = sorted(list(map(int, input().split())), reverse = True)
list = []
for aa in a:
for bb in b:
list.append(aa+bb)
list.sort(reverse ... | p03078 |
X, Y, Z, K = [int(_) for _ in input().split()]
As = [int(_) for _ in input().split()]
Bs = [int(_) for _ in input().split()]
Cs = [int(_) for _ in input().split()]
As.sort()
Bs.sort()
Cs.sort()
choice_stack = [(len(As) - 1, len(Bs) - 1, len(Cs) - 1)]
choice_stack_next = []
choice_log = set()
sums = []
... | X, Y, Z, K = [int(_) for _ in input().split()]
As = [int(_) for _ in input().split()]
Bs = [int(_) for _ in input().split()]
Cs = [int(_) for _ in input().split()]
As.sort()
Bs.sort()
Cs.sort()
choice_stack = [(As[-1] + Bs[-1] + Cs[-1], len(As) - 1, len(Bs) - 1, len(Cs) - 1)]
choice_log = set()
j = 0
wh... | p03078 |
import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
c = c[:k]
e = []
cnt = 0
for va in a:
for vb in b:
heapq... | import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
e = []
for va in a:
for vb in b:
e.append(va+vb)
e.sort(reverse=True)
e = e[:k]
d = []
for ve in e:
for vc in c:
... | p03078 |
import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
e = []
for va in a:
for vb in b:
e.append(va+vb)
e.sort(reverse=True)
e = e[:k]
d = []
for ve in e:
for vc in c:
... | import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
e = []
# AxB を取得
for va in a:
for vb in b:
heapq.heappush(e, -(va+vb))
# AxB は 大きい方から最大k個のみ使う
d = []
ite = min(k, len(e)... | p03078 |
#!/usr/bin/env python3.4
# -*- coding: utf-8 -*-
# abc123_d
import itertools
import math
# input
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# A = range(1000)
# B = range(1000)
# C = range(1000)
... | #!/usr/bin/env python3.4
# -*- coding: utf-8 -*-
# abc123_d
import itertools
import math
# input
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# A = range(1000)
# B = range(1000)
# C = range(1000)
... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
AB = []
for i in range(X):
for j in range(Y):
AB.append(A[i] + B[j])
AB.sort(... | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ABC = []
for i in range(X):
for j in range(Y):
if (i + 1) * (j + 1) > K:
... | p03078 |
#conding utf-8
x,y,z,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ab=[]
ans=[]
for i in range(len(a)):
for j in range(len(b)):
ab.append(a[i]+b[j])
ab.sort()
ab.reverse()
del ab[k:]
for i in range(len(... | #conding utf-8
x,y,z,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ab=[]
ans=[]
for i in range(len(a)):
for j in range(len(b)):
ab.append(a[i]+b[j])
ab.sort()
ab.reverse()
del ab[k:]
c.sort()
c.reverse... | p03078 |
#conding utf-8
x,y,z,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ab=[]
ans=[]
for i in range(len(a)):
for j in range(len(b)):
ab.append(a[i]+b[j])
ab.sort()
ab.reverse()
del ab[k:]
c.sort()
c.reverse... | #conding utf-8
x,y,z,K=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
a.sort()
b.sort()
c.sort()
a.reverse()
b.reverse()
c.reverse()
ans=[]
for i in range(len(a)):
for j in range(len(b)):
if (i+1)*(j+1)>K:
... | p03078 |
X,Y,Z,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
import heapq
ans = []
heapq.heapify(ans)
for a in A:
for b in B:
for c in C:
heapq.heappush(ans,-(a+b+c))
for _ in range(K):
i = heapq.h... | X,Y,Z,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
# A,B,Cのリストを降順にソート
A.sort(reverse =True)
B.sort(reverse =True)
C.sort(reverse =True)
# A,B,Cを上からp,q,r番目を選択した場合にp*q*rがKより大きい組み合わせがKより上位に来ることはない
# A,B,Cを上から参照していき。... | p03078 |
x,y,z,k = list(map(int,input().split()))
al = list(map(int,input().split()))
bl = list(map(int,input().split()))
cl = list(map(int,input().split()))
al = sorted(al)
bl = sorted(bl)
cl = sorted(cl)
rank = []
for xx in range(x-1,-1,-1):
tmp = al[xx]+bl[-1]+cl[-1]
if len(rank) >= k:
if rank... | x,y,z,k = list(map(int,input().split()))
al = list(map(int,input().split()))
bl = list(map(int,input().split()))
cl = list(map(int,input().split()))
al = sorted(al)
bl = sorted(bl)
cl = sorted(cl)
rank = []
flag = False
for xx in range(x-1,-1,-1):
tmp = al[xx]+bl[-1]+cl[-1]
if flag and rank[-1] ... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
sumsofAandB = sorted([a+b for a in A for b in B])
sumsofAll = sorted([ab+c for ab in sumsofAandB for c in C], reverse=True)
for i in range(K):
print((sums... | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
sumsofAandB = sorted([a+b for a in A for b in B], reverse=True)[:K]
sumsofAll = sorted([ab+c for ab in sumsofAandB for c in C], reverse=True)
for i in range(K)... | p03078 |
# -*- coding:utf-8 -*-
def solve():
X, Y, Z, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
B = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
ans = []
for x in range(X):
for y in range(Y):
for z in rang... | # -*- coding:utf-8 -*-
def solve():
""" TLE """
X, Y, Z, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
B = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
ans = []
for x in range(X):
for y in range(Y):
... | p03078 |
# -*- coding:utf-8 -*-
def solve():
""" TLE """
X, Y, Z, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
B = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
ans = []
for x in range(X):
for y in range(Y):
... | # -*- coding:utf-8 -*-
def solve():
""" TLE """
X, Y, Z, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
B = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
... | p03078 |
import sys
x, y, z, k = list(map(int, sys.stdin.readline().split()))
xlist = sorted(list([int(i)
for i in sys.stdin.readline().split()]), reverse=True)[:min(x, k)]
ylist = sorted(list([int(i)
for i in sys.stdin.readline().split()]), reverse=True)[:min(y, k)]
zlist = s... | import sys
x, y, z, k = list(map(int, sys.stdin.readline().split()))
xlist = sorted(list([int(i)
for i in sys.stdin.readline().split()]), reverse=True)[:min(x, k)]
ylist = sorted(list([int(i)
for i in sys.stdin.readline().split()]), reverse=True)[:min(y, k)]
zlist = s... | p03078 |
from bisect import bisect_left
from heapq import heappush, heappop
X, Y, Z, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
*C, = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
# x以上のものがK個あるならOK
... | from heapq import heappush, heappop
X, Y, Z, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
*C, = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
# x以上のものがK個あるならOK
def f(x):
cnt = 0
for... | p03078 |
from heapq import heappop, heappush
from itertools import product
X, Y, Z, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
*C, = list(map(int, input().split()))
A.sort(reverse=True)
D = [i+j for j in C for i in B]
D.sort(reverse=True)
q = []... | from heapq import heappop, heappush
X, Y, Z, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
*C, = list(map(int, input().split()))
A.sort(reverse=True)
# Bi+Cjの和を求め、降順にソートしておく(Dkとします)
D = [i+j for j in C for i in B]
D.sort(reverse=True)
# Ai... | p03078 |
x,y,z,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[int(x) for x in input().split()]
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
s=list()
for l in range(x):
for m in range(y):
for n in range(z):
if l*m*n>... | x,y,z,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[int(x) for x in input().split()]
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
s=list()
for l in range(x):
if l>k:
break
for m in range(y):
if l*m>k:
b... | p03078 |
import sys,queue,math,copy,itertools,bisect,collections
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
X,Y,Z,K = LI()
A = LI()
B = LI()
C = LI()
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
h = A[0] + B[0] + C[0]
l = 0
while h > l+1:
m = (h+l) // 2
num = 0
... | import sys,queue,math,copy,itertools,bisect,collections
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
X,Y,Z,K = LI()
A = LI()
B = LI()
C = LI()
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
h = A[0] + B[0] + C[0]
l = 0
while h > l+1:
m = (h+l) // 2
num = 0
... | p03078 |
x, y, z, k = list(map(int, input().split()))
c_s = list(map(int, input().split()))
b_s = list(map(int, input().split()))
a_s = list(map(int, input().split()))
a_s.sort(reverse=True)
b_s.sort(reverse=True)
c_s.sort(reverse=True)
d = {}
abcs = [0]
j = -1
for a in a_s:
for b in b_s:
for c in c_... | x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ab = []
for ai in a:
for bi in b:
ab.append(ai + bi)
ab.sort(reverse = True)
abc = []
for abi in ab[:k]:
for ci in c:
abc.append(abi + ci... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
l = []
for i in a:
for j in b:
for k in c:
l.append(i + j + k)
l.sort(reverse = True)
for i in range(K):
print((l[i])) | X, Y, Z, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
l = []
for i in range(X):
for j in range(Y):
l.append(a[i] + b[j])
l.sort(reverse = True)
l = l[:K]
L = []
for i in range(len(l)):
for ... | p03078 |
X, Y, Z, K = [int(i) for i in input().split()]
ABCList = [sorted([int(i) for i in input().split()], reverse=True) for _ in range(3)]
ABSum = sorted([i + j for i in ABCList[0] for j in ABCList[1]], reverse=True)[:K]
for ans in sorted([i + j for i in ABSum for j in ABCList[2]], reverse=True)[:K]:
print(ans)
| X, Y, Z, K = [int(i) for i in input().split()]
ABCList = [sorted([int(i) for i in input().split()], reverse=True) for _ in range(3)]
ansList = []
for i, A in enumerate(ABCList[0]):
for j, B in enumerate(ABCList[1]):
for k, C in enumerate(ABCList[2]):
if (i + 1) * (j + 1) * (k + 1) <= K:
... | p03078 |
import bisect
X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
nums = []
for a in A:
for b in B:
for c in C:
n = ... | X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
E = sorted([a+b for a in A for b in B], reverse=True)
E = E[:K]
nums = sorted([e+c for e in... | p03078 |
X,Y,Z,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
K=min(K,3000)
AB=[a+b for a in A for b in B]
AB.sort(reverse=True)
ABC=[ab+c for ab in AB[:K] for c in C]
ABC.sort(reverse=True)
for k in range(K):
print((ABC[k]... | X,Y,Z,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
K=min(K,3000)
AB=[a+b for a in A for b in B]
AB.sort(reverse=True)
ABC=[ab+c for ab in AB[:K] for c i... | p03078 |
x,y,z,k=list(map(int,input().split()))
a,b,c=[list(map(int,input().split())) for i in range(3)]
l=[i+j for i in a for j in b]
l.sort(reverse=True)
maxl=[i+j for i in l[:k] for j in c]
maxl.sort(reverse=True)
for a in maxl[:k]:
print(a) | x,y,z,k=list(map(int,input().split()))
a,b,c=[sorted(list(map(int,input().split())),reverse=True) for i in range(3)]
L=[]
for i in range(x):
for j in range(y):
if (i+1)*(j+1)>k:
break
for m in range(z):
if (i+1)*(j+1)*(m+1)>k:
break
else:... | p03078 |
import heapq
X,Y,Z,K = list(map(int,input().split()))
Alist = list( map(int, input().split()))
Blist = list(map(int, input().split()))
Clist = list( map(int, input().split()))
sum =[]
heapq.heapify(sum)
for i in range(0,X):
for j in range(0,Y):
for k in range(0,Z):
heapq.heappu... | import heapq
X,Y,Z,K = list(map(int,input().split()))
Alist = list( map(int, input().split()))
Blist = list(map(int, input().split()))
Clist = list( map(int, input().split()))
Alist.sort(reverse=True)
Blist.sort(reverse=True)
Clist.sort(reverse=True)
sum =[]
heapq.heapify(sum)
arg_hash = {}
heapq.h... | p03078 |
from heapq import heappush, heappop
X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
q = []
x = y = z = 0
heappush(q, (-(A[x] + B[y] + C[z]), (x,... | X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ans = []
for x in range(X):
for y in range(Y):
for z in range(Z):
if (x +... | p03078 |
# solution 2
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
L = []
for i in range(X):
for j in range(Y):
for k in range(Z):
... | # solution 2
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
L = []
for i in range(X):
for j in range(Y):
if (i+1)*(j+1) > K:
... | p03078 |
# solution 3
import heapq
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
Q = []
s = []
heapq.heappush(Q, (-A[0]-B[0]-C[0], 0, 0, 0))
for n ... | # solution 3
import heapq
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
Q = []
s = set()
heapq.heappush(Q, (-A[0]-B[0]-C[0], 0, 0, 0))
for... | p03078 |
x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
c = sorted(list(map(int, input().split())), reverse=True)
d = []
for i in range(len(a)):
for j in range(len(b)):
d.append(a[i]+b[j])
tm... | x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
c = sorted(list(map(int, input().split())), reverse=True)
sumAB = sorted([ai + bi for ai in a for bi in b],reverse=True)[:k]
final_ans = sorted([ci + ab... | p03078 |
from heapq import heapify, heappush, heappop, heapreplace
from collections import deque
import sys
input = sys.stdin.readline
X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=Tr... | from heapq import heapify, heappush, heappop, heapreplace
import sys
input = sys.stdin.readline
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)... | p03078 |
X,Y,Z,K=list(map(int,input().split()))
A=[int(x) for x in input().split()]
B=[int(x) for x in input().split()]
C=[int(x) for x in input().split()]
A.sort(reverse =True)
B.sort(reverse =True)
C.sort(reverse =True)
answer=[]
for p in range(min(X,K)):
for q in range(min(Y,K)):
for r in range(min(Z,K)):
... | X,Y,Z,K=list(map(int,input().split()))
A=[int(x) for x in input().split()]
B=[int(x) for x in input().split()]
C=[int(x) for x in input().split()]
A.sort(reverse =True)
B.sort(reverse =True)
C.sort(reverse =True)
answer=[]
for p in range(min(X,K)):
for q in range(min(Y,K)):
if p*q>K:
break
f... | p03078 |
#!/usr/bin/env python
x, y, z, k = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
D = []
E = []
for b in B:
for c in C:
D.append(b+c)
D.sor... | #!/usr/bin/env python
x, y, z, k = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
D = []
E = []
for b in B:
for c in C:
D.append(b+c)
D.sor... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A = sorted(A, key = lambda x:-x)
B = sorted(B, key = lambda x:-x)
C = sorted(C, key = lambda x:-x)
AB = [0] * (X * Y)
index = 0
for i in range(len(... | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A = sorted(A, key = lambda x:-x)
B = sorted(B, key = lambda x:-x)
C = sorted(C, key = lambda x:-x)
AB = [0] * (X * Y)
ABC = []
for i in range(X):... | p03078 |
X,Y,Z,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A = sorted(A,reverse=True)
B = sorted(B,reverse=True)
C = sorted(C,reverse=True)
#print(A,B,C)
list1 = []
a,b,c = 0,0,0
for a in range(X):
for b in ran... | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
AB = [0] * (X * Y)
for i in range(X):
for j in range(Y):
AB[i * Y + j] = A[i] + B[j]
AB = sorted(AB, reverse = True)[:K]
#print(AB)
ABC = []
for i... | p03078 |
x,y,z,k=list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
c=list(map(int, input().split()))
import itertools
combi=list(itertools.product(a,b,c))
ans=[0]*len(combi)
for i in range(len(combi)):
ans[i]= sum(combi[i])
ans.sort(reverse=True)
for x in ans[:k]:
... | x,y,z,k=list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
c=list(map(int, input().split()))
import itertools
combi=list(itertools.product(a,b))
ans=[0]*len(combi)
for i in range(len(combi)):
ans[i]= sum(combi[i])
ans.sort(reverse=True)
combi2=list(itertool... | p03078 |
x, y, z, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
L = []
for i in A:
for j in B:
L.append(i+j)
S = sorted(L, reverse=True)[:k]
T = []
for i in S:
for j in sorted(C, reverse=True)[:k]:
T.append(i+j)
... | x, y, z, k = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
L = []
for i in range(min(x, k)):
for j in range(min(y, k//(i+1))):
for l in range(min(z, k//(... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
L = []
for a in A:
for b in B:
L.append(a + b)
L.sort(reverse = True)
ans = []
for i, l in enumerate(L):
if i == K:
break
else:
for c i... | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse = True)
B.sort(reverse = True)
C.sort(reverse = True)
L = []
for i, a in enumerate(A):
for j, b in enumerate(B):
if i * j > K:
... | p03078 |
X,Y,Z,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
ABC = []
for a in A:
for b in B:
for c in C:
ABC.append(a+b+c)
ABC = sorted(ABC,reverse=True)
for k in range(K):
print((ABC[k]))
... | X,Y,Z,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
AB = []
for a in A:
for b in B:
AB.append(a+b)
AB = sorted(AB,reverse=True)[:K]
C = sorted(C,reverse=True)
ABC = []
for c in C:
for ab in AB:
... | p03078 |
# -*- coding: utf-8 -*-
"""
D - Cake 123
https://atcoder.jp/contests/abc123/tasks/abc123_d
"""
import sys
from itertools import product
def solve(X, Y, Z, K, A, B, C):
res_AB = sorted([sum(p) for p in product(A, B)], reverse=True)[:K]
return sorted([sum(p) for p in product(res_AB, C)], reverse=... | # -*- coding: utf-8 -*-
"""
D - Cake 123
https://atcoder.jp/contests/abc123/tasks/abc123_d
"""
import sys
from itertools import product
def solve(X, Y, Z, K, A, B, C):
# TLE
res_AB = sorted([sum(p) for p in product(A, B)], reverse=True)[:K]
return sorted([sum(p) for p in product(res_AB, C)... | p03078 |
# -*- coding: utf-8 -*-
"""
D - Cake 123
https://atcoder.jp/contests/abc123/tasks/abc123_d
AC
"""
import sys
from itertools import product
def solve(X, Y, Z, K, A, B, C):
# 解説の解法#2
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
res = []
for i, a in enumerate(A... | # -*- coding: utf-8 -*-
"""
D - Cake 123
https://atcoder.jp/contests/abc123/tasks/abc123_d
AC
"""
import sys
def solve(X, Y, Z, K, A, B, C):
# 解説の解法#2
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
res = []
for i, a in enumerate(A, start=1):
for j, b in en... | p03078 |
x,y,z,k=list(map(int,input().split()))
al=[int(i) for i in input().split()]
bl=[int(i) for i in input().split()]
cl=[int(i) for i in input().split()]
lst=[i+j for i in al for j in bl]
lst.sort(reverse=True)
num=min(x*y,k)
lst=lst[:num]
L=[i+j for i in cl for j in lst]
L.sort(reverse=True)
for i in range(k):
... | def main():
x,y,z,k=list(map(int,input().split()))
al=[int(i) for i in input().split()]
bl=[int(i) for i in input().split()]
cl=[int(i) for i in input().split()]
lst=[i+j for i in al for j in bl]
lst.sort(reverse=True)
num=min(x*y,k)
lst=lst[:num]
L=[i+j for i in cl for j in lst]
L.sort(re... | p03078 |
x,y,z,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
a.sort(reverse=True),b.sort(reverse=True),c.sort(reverse=True)
ab = []
for i in range(x):
for j in range(y):
ab.append(a[i]+b[j])
ab.sort(reverse=Tr... | x,y,z,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
a.sort(reverse=True),b.sort(reverse=True),c.sort(reverse=True)
abc = []
for i in range(x):
for j in range(y):
for l in range(z):
if... | p03078 |
import itertools
import sys
input = sys.stdin.readline
maxn = 10000000000
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.append(-maxn)
B.append(-maxn)
C.append(-maxn)
A.sort(reverse=True)
B.... | import itertools
import sys
input = sys.stdin.readline
maxn = 10000000000
X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
cand = []
... | p03078 |
x, y, z, k = list(map(int, input().split()))
alist = list(map(int, input().split()))
blist = list(map(int, input().split()))
clist = list(map(int, input().split()))
alist.sort(reverse=True)
blist.sort(reverse=True)
clist.sort(reverse=True)
delist = []
for a in range(x) :
for b in range(y) :
if a+b... | x, y, z, k = list(map(int, input().split()))
alist = list(map(int, input().split()))
blist = list(map(int, input().split()))
clist = list(map(int, input().split()))
alist.sort(reverse=True)
blist.sort(reverse=True)
clist.sort(reverse=True)
delist = []
for a in range(x) :
for b in range(y) :
if a*b... | p03078 |
def main():
X, Y, Z, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
AB = []
ABappend = AB.append
for i in range(X):
for j in range(Y):
ABappend(A[i] + B[j])
... | def main():
X, Y, Z, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
AB = []
ABappend = AB.append
for i in range(X):
for j in range(Y):
ABappend(A[i] + B[j])
... | p03078 |
from itertools import product
x, y, z, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
AB = [sum(ab) for ab in product(A, B)]
AB.sort(reverse=True)
AB = AB[:k]
ABC = [sum(abc) for abc in product(AB, C)]
ABC.sort(rev... | x, y, z, K = list(map(int, input().split()))
A = sorted(map(int, input().split()), reverse=True)
B = sorted(map(int, input().split()), reverse=True)
C = sorted(map(int, input().split()), reverse=True)
ans = []
for i in range(x):
for j in range(y):
for k in range(z):
if (i+1)*(j+1)*(k+1) ... | p03078 |
x, y, z, k = list(map(int, input().split()))
X = [int(i) for i in input().split()]
Y = [int(i) for i in input().split()]
Z = [int(i) for i in input().split()]
count = []
for i in X:
for j in Y:
for l in Z:
count.append(i+j+l)
count.sort(reverse=1)
for c in range(k):
print(... | x, y, z, k = list(map(int, input().split()))
X = [int(i) for i in input().split()]
Y = [int(i) for i in input().split()]
Z = [int(i) for i in input().split()]
answer = []
for i in X:
for j in Y:
answer.append(i+j)
answer.sort(reverse=1)
answer2 = []
for l in Z[:k]:
for a in answer[:k]:
... | p03078 |
x, y, z, k = list(map(int, input().split()))
X = [int(i) for i in input().split()]
Y = [int(i) for i in input().split()]
Z = [int(i) for i in input().split()]
X.sort(reverse=1)
Y.sort(reverse=1)
Z.sort(reverse=1)
answer = []
for i in X[:k]:
for j in Y[:k]:
answer.append(i+j)
answer.sort(reverse... | x, y, z, k = list(map(int, input().split()))
X = [int(i) for i in input().split()]
Y = [int(i) for i in input().split()]
Z = [int(i) for i in input().split()]
X.sort(reverse=1)
Y.sort(reverse=1)
Z.sort(reverse=1)
answer = [i+j for i in X[:k] for j in Y[:k]]
answer.sort(reverse=1)
answer2 = [i+j for i in Z[... | p03078 |
x, y, z, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
result = []
for c in range(z):
for b in range(y):
for a in range(x):
result.append(A[a] + B[b] + C[c])
result.sort()
[print(val) for va... | x, y, z, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
result = []
def func1():
E = [a+b for a in A for b in B]
E.sort()
if len(E) > k: E = E[-k:]
F = [c+e for c in C for e in E]
F.sort()
ret... | p03078 |
X,Y,Z,K = list(map(int,input().split()))
K = min(K,X*Y*Z)
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
A.sort(reverse = True)
B.sort(reverse = True)
C.sort(reverse = True)
sum2 = []
for a in A:
for b in B:
sum2.append(a+b)
sum2.sort(rev... | import heapq
X,Y,Z,K = list(map(int,input().split()))
K = min(K,X*Y*Z)
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
A.sort(reverse = True)
B.sort(reverse = True)
C.sort(reverse = True)
set_ = set()
hq = [(-(A[0]+B[0]+C[0]),0,0,0)]
heapq.heapify(... | p03078 |
x,y,z,K = list(map(int, input().split()))
abc = [sorted(list(map(int, input().split())), reverse=True) for i in range(3)]
ans = []
for i in range(x):
for j in range(y):
for k in range(z):
if (i+1)*(j+1)*(k+1) <= K:
ans.append(abc[0][i]+abc[1][j]+abc[2][k])
for i in sort... | x,y,z,K = list(map(int, input().split()))
abc = [sorted(list(map(int, input().split())), reverse=True) for i in range(3)]
ans = []
for i in range(x):
for j in range(y):
for k in range(z):
if (i+1)*(j+1)*(k+1) <= K:
ans.append(abc[0][i]+abc[1][j]+abc[2][k])
e... | p03078 |
import bisect
a,b,c,k = list(map(int,input().split()))
aa = list(map(int,input().split()))
bb = list(map(int,input().split()))
cc = list(map(int,input().split()))
aa.sort(reverse = True)
bb.sort(reverse = True)
cc.sort(reverse = True)
al = []
for i in range(a):
for j in range(b):
for l in ran... | a,b,c,k = list(map(int,input().split()))
aa = list(map(int,input().split()))
aa.sort(reverse = True)
bb = list(map(int,input().split()))
bb.sort(reverse = True)
cc = list(map(int,input().split()))
cc.sort(reverse = True)
al = []
aal = []
for i in aa:
for j in bb:
al.append(i+j)
al.sort()
if l... | p03078 |
x,y,z,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a = sorted(a)
b = sorted(b)
c = sorted(c)
memory = []
ai = x-1
bi = y-1
ci = z-1
p = 10**11
while k>0:
ps = []
abc = []
for dx in range(-8,8):
... | def main():
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
T = []
for a in A:
for b in B:
... | p03078 |
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# A.sort(reverse=True)
# B.sort(reverse=True)
# C.sort(reverse=True)
# m = A[0]+B[0]+C[0]
AB = []
for a in A:
for b in B:
AB.append(a+b)
ABC = ... | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# A.sort(reverse=True)
# B.sort(reverse=True)
# C.sort(reverse=True)
# m = A[0]+B[0]+C[0]
AB = []
ABC = []
for a in A:
for b in B:
AB.append(a+... | p03078 |
x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]
sum_cake = sorted([a+b+c for a in a_cake for b in b_cake for c in c_cake],reverse=True)[:k]
for i in sum_cake:
print(i)
| x,y,z,k = [int(num) for num in input().split()]
a_cake,b_cake,c_cake = [sorted([int(num) for num in input().split()],reverse=True)[:k] for _ in range(3)]
sum_cake=list()
for i,a in enumerate(a_cake,1):
for j,b in enumerate(b_cake,1):
if(i*j>k):
break
for n,c in enumerate(c_cake,... | p03078 |
import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
def diff(l):
m = max(l)
return sorted(m - v for v in l)[1:]
s = sum(map(max, [a, b, c]))
sa, sb, sc = list(map(diff, [a, b, c]))
d... | import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
def diff(l):
m = max(l)
return sorted(m - v for v in l)[1:]
s = sum(map(max, [a, b, c]))
sa, sb, sc = list(map(diff, [a, b, c]))
d... | p03078 |
import heapq
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
def diff(l):
m = max(l)
return sorted(m - v for v in l)[1:]
s = sum(map(max, [a, b, c]))
sa, sb, sc = list(map(diff, [a, b, c]))
d... | import heapq
x, y, z, k = list(map(int, input().split()))
a = sorted(map(int, input().split()))
b = sorted(map(int, input().split()))
c = sorted(map(int, input().split()))
q = []
memo = set()
def qpush(q, ai, bi, ci):
t = (-(a[ai] + b[bi] + c[ci]), ai, bi, ci)
if not t in memo:
memo.add(t)... | p03078 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.