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;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m,k;
cin >> n >> m >> k;
vector<int> a(n),b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
int sum = 0LL;
for (int i = 0; i < m; i++)
sum+=b[i];
vector<vector<bool>> dp(m,vector<bool>(sum+1));
dp[0][0] = 1;
dp[0][b[0]] = 1;
for (int i = 1; i < m; i++)
for (int j = b[i]; j <= sum; j++)
dp[i][j] = (dp[i-1][j-b[i]] | dp[i-1][j]);
int oth = 0;
for (int i = 0; i < n; i++)
oth+=a[i];
for (int i = oth; i <= sum; i++)
if (dp[m-1][i])
{
cout << i << '\n';
return 0;
}
cout << "Impossible\n";
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... |