#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
int a[MAXN], b[MAXN];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m,k; cin>>n>>m>>k;
for(int i = 1; i <= n; i++)cin>>a[i];
for(int i = 1; i <= m; i++)cin>>b[i];
sort(b+1,b+1+m);
int p = 1;
for(int i = 1; i <= n; i++){
while(p <= m && b[p] < a[i]){
a[i] -= b[p];
p++;
}
if(p > m)break;
b[p] -= a[i];
}
if(p > m)cout<<"Impossible\n";
else cout<<b[p]<<"\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... |