This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define mod 1000000007
#define boost ios_base::sync_with_stdio(false), cin.tie(NULL);
using namespace std;
int dp[200001],a[20001],b[200001];
signed main(){
boost;
int n,m,k,sum = 0; cin >> n >> m >> k;
for(int i = 0; i < n; i++){
cin >> a[i]; sum += a[i];
}
for(int j = 0; j < m; j++) cin >> b[j];
if(m < k){
cout << "Impossible";
return 0;
}
for(int i = 0; i < n; i++){
if(a[i] < k){
cout << "Impossible";
return 0;
}
}
for(int i = 0; i < m; i++){
for(int j = 90000; j >= b[i]; j--){
dp[j] = max(dp[j], dp[j - b[i]] + min(b[i],n));
}
}
for(int i = sum; i <= 90000; i++){
if(dp[i] >= n * k){
cout << i - sum;
return 0;
}
}
cout << "Impossible";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |