Submission #984371

#	Time	Username	Problem	Language	Result	Execution time	Memory
984371		OAleksa	Kitchen (BOI19_kitchen)	C++14	0 / 100	20 ms	1116 KiB

kitchen

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N = 310;
int n, m, k, a[N], b[N];
int dp[N * N], ndp[N * N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> m >> k;
  	for (int i = 1;i <= n;i++)
  		cin >> a[i];
  	sort(a + 1, a + n + 1);
  	for (int i = 1;i <= m;i++)
  		cin >> b[i];
  	if (m < k || a[1] < k)
  		cout << "Impossible";
  	else {
  		dp[0] = 1;
			for (int i = 1;i <= m;i++) {
				for (int j = 0;j < N * N;j++) {
					if (j < b[i])
						ndp[j] = dp[j];
					else
						ndp[j] = dp[j - b[i]];
				}
				for (int i = 0;i < N * N;i++)
					dp[i] = ndp[i], ndp[i] = 0;
			}
			int s = 0, ans = 1e9;
			for (int i = 1;i <= n;i++)
				s += a[i];
			for (int i = N * N;i >= s;i--) {
				if (dp[i])
					ans = i - s;
			}
			assert(ans != 1e9);
			cout << ans << '\n';
  	}
  }
  return 0; 
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28