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>
#include <iostream>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define a first
#define b second
#define pb push_back
int n,m,k;
int aa[301];
int bb[301];
const int li=400*400;
int dp[li];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(dp,0,sizeof(dp));
dp[0]=1;
cin>>n>>m>>k;
int su=0;
for(int i=0;i<n;i++){
cin>>aa[i];
su+=aa[i];
}
for(int i=0;i<m;i++){
cin>>bb[i];
}
for(int i=0;i<m;i++){
for(int j=li;j>=bb[i];j--){
dp[j]=max(dp[j],dp[j-bb[i]]);
}
}
int ans=-1;
for(int i=su;i<li;i++){
if(dp[i]){
ans=i-su;
break;
}
}
if(ans==-1){
cout<<"Impossible"<<endl;
}
else{
cout<<ans<<endl;
}
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... |