import array
N = 300
n,m,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
supply = array.array('i', [-N*N for i in range(N*N+1)])
supply[0] = 0;
def solve():
if(min(a) < k):
return 'Impossible'
bsum = 0
for x in b:
bsum += x
for i in range(bsum,-1,-1):
supply[i+x] = max(supply[i+x],supply[i]+min(x,n))
for i in range(sum(a),N*N+1):
if(supply[i] >= n*k):
return i-sum(a)
return 'Impossible'
print(solve())
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
14 ms |
3016 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
14 ms |
3016 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
14 ms |
2936 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
14 ms |
2908 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
14 ms |
3016 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |