# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544746 | rainboy | Kitchen (BOI19_kitchen) | C11 | 28 ms | 640 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 <stdio.h>
#include <string.h>
#define N 300
#define M 300
#define K 300
#define B 300
#define S (M * B)
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int dp[S + 1];
int n, m, k, i, s, s_;
scanf("%d%d%d", &n, &m, &k);
if (m < k) {
printf("Impossible\n");
return 0;
}
s_ = 0;
for (i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (a < k) {
printf("Impossible\n");
return 0;
}
s_ += a;
}
memset(dp, -1, sizeof dp), dp[0] = 0;
while (m--) {
int b;
scanf("%d", &b);
for (s = S; s >= b; s--)
if (dp[s - b] != -1)
dp[s] = max(dp[s], dp[s - b] + min(b, n));
}
for (s = s_; s <= S; s++)
if (dp[s] >= n * k) {
printf("%d\n", s - s_);
return 0;
}
printf("Impossible\n");
return 0;
}
Compilation message (stderr)
# | 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... |