Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int n;
- scanf("%d", &n);
- int p,c,ans[n];
- for (int x = 0 ; x < n ; x++) {
- scanf("%d %d", &p, &c);
- int a[p];
- for (int i = 0 ; i < p ; i++) scanf("%d", &a[i]);
- int b[c],w = 0;
- for (int i = 0 ; i < c ; i++)
- if (w < p) b[i] = a[w++];
- int idle = 0;
- for (w ; w < p ; w++) {
- for (int i = 0 ; i < c ; i++) if (b[idle] > b[i]) idle = i;
- b[idle] += a[w];
- }
- idle = b[0];
- for (int i = 1 ; i < c ; i++)
- if (idle < b[i]) idle = b[i];
- ans[x] = idle;
- }
- for (int i = 0 ; i < n ; i++) printf("Case #%d : %d\n", i+1, ans[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement