#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;
const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("../../input.txt", "r", stdin);
freopen("../../output.txt", "w", stdout);
#endif*/
InTheNameOfGod;
int n,m,k;
cin >>n >> m >> k;
vector<int> a(n),b(m);
int s = 0, must = (n-1)*k;
bool ok = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if(a[i] < k) ok = 1;
}
for(int &i : b) cin >> i;
if(ok || m < k) {
cout << "Impossible\n";
return 0;
}
int mo = INF;
for(int mask = 1; mask < (1<<n); mask++) {
int sum = 0, maxi = -1;
for(int i = 0; i < n; i++) {
if((1<<i) & mask) {
sum += b[i];
maxi = max(maxi, b[i]);
}
}
if(sum > s && must <= sum - maxi) {
mo = min(mo, sum);
}
}
if(mo == INF) cout << "Impossible\n";
else cout << mo - s;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1063 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |