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>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m,k;
cin>>n>>m>>k;
vector<int>alln(n),allm(m);
int f=0;
int sumn=0;
for(int i=0;i<n;i++){
cin>>alln[i];
if(alln[i]<k){
f=1;
}
sumn+=alln[i];
}
int summ=0,mainsumm=0;
for(int i=0;i<m;i++){
cin>>allm[i];
summ+=min(allm[i],n);
mainsumm+=allm[i];
}
if(f==1||summ<n*k||mainsumm<sumn){
cout<<"Impossible\n";
return 0;
}
int res=1e9+5;
for(int i=0;i<(1<<m);i++){
summ=0,mainsumm=0;
for(int j=0;j<m;j++){
if((i>>j)&1){
summ+=min(allm[j],n);
mainsumm+=allm[j];
}
}
if(summ>=n*k&&mainsumm>=sumn){
res=min(res,mainsumm-sumn);
}
}
cout<<res<<"\n";
}
| # | 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... |