# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134877 | miguel | Kitchen (BOI19_kitchen) | C++14 | 0 ms | 0 KiB |
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;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 998244353;
nt n, m, k, s;
int a[605], b[605], dp[2][1000001];
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
cin>>n>>m>>k;
//if(m<k) return cout<<"Impossible", 0;
for(int i=1; i<=n; i++){
cin>>a[i];
s+=a[i];
if(a[i]<k) return cout<<"Impossible", 0;
}
for(int i=1; i<=m; i++) cin>>b[i];
dp[0][0]=0;
//int cur=0;
for(int i=1; i<=m; i++){
for(int h=0; h<=nmax*nmax; h++){
dp[1][h+b[i]]=max(dp[0][h+b[i]], dp[0][h]+min(b[i], n));
}
//cur+=b[i];
for(int h=0; h<=nmax*nmax; h++) dp[0][h]=dp[1][h];
}
//cout<<"xd";
for(int h=s; h<=nmax*nmax; h++){
//cout<<h<<" "<<dp[0][h]<<endl;
if(dp[0][h]>=n*k) return cout<<h-s, 0;
}
cout<<"Impossible";
}