CODEFORCES #632 E. Thief in a Shop

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 const int N = 501;
 7 int n, k, a[N], f[N * N];
 8 
 9 int main() {
10     scanf("%d %d", &n, &k);
11     for (int i = 1; i <= n; i ++) scanf("%d", &a[i]);
12     sort(a + 1, a + n + 1);
13     for (int i = 2; i <= n; i ++) a[i] -= a[1];
14     for (int i = 1; i <= k * a[n]; i ++) f[i] = k + 1;
15     for (int i = 2; i <= n; i ++)
16         for (int j = a[i]; j <= k * a[n]; j ++) f[j] = min(f[j], f[j - a[i]] + 1);
17     for (int i = 0; i <= k * a[n]; i ++) if (f[i] <= k) printf("%d ", i + a[1] * k);
18     return 0;
19 }