Submission #888754

#TimeUsernameProblemLanguageResultExecution timeMemory
88875412345678Kitchen (BOI19_kitchen)C++17
20 / 100
13 ms824 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=305;
int n, m, k, sm, x, dp[nx*nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>k;
    for (int i=1; i<=n; i++) cin>>x, sm+=x;
    dp[0]=1;
    for (int i=1; i<=m; i++)
    {
        cin>>x;
        for (int j=nx*nx-x-1; j>=0; j--) dp[j+x]|=dp[j];
    }
    for (int i=sm; i<nx*nx; i++)
    {
        if (dp[i])
        {
            cout<<i-sm;
            return 0;
        }
    }
    cout<<"Impossible";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...