Submission #745852

#TimeUsernameProblemLanguageResultExecution timeMemory
745852vjudge1Kitchen (BOI19_kitchen)C++14
0 / 100
47 ms648 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; vector<int>a(n), b(m); int sum = 0; for(int i = 0; i < n; i++){ cin >> a[i]; sum += a[i]; } vector<int> dp(90001, -1); dp[0] = -2; for(int i = 0; i < m; i++){ cin >> b[i]; for(int j = b[i]; j <= 90000; j++){ if(dp[j - b[i]] != -1 && dp[j - b[i]] != i && dp[j] == -1){ dp[j] = i; } } } int mn = INT_MAX; for(int i = sum; i <= 90000; i++){ if(dp[i] > 0){ mn = min(mn, abs(sum - i)); } } cout << mn << endl; }
#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...