Advertisement
Guest User

Untitled

a guest
May 26th, 2019
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.66 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5. int n;
  6. scanf("%d", &n);
  7.  
  8. int p,c,ans[n];
  9. for (int x = 0 ; x < n ; x++) {
  10. scanf("%d %d", &p, &c);
  11.  
  12. int a[p];
  13. for (int i = 0 ; i < p ; i++) scanf("%d", &a[i]);
  14.  
  15. int b[c],w = 0;
  16. for (int i = 0 ; i < c ; i++)
  17. if (w < p) b[i] = a[w++];
  18.  
  19. int idle = 0;
  20. for (w ; w < p ; w++) {
  21. for (int i = 0 ; i < c ; i++) if (b[idle] > b[i]) idle = i;
  22. b[idle] += a[w];
  23. }
  24.  
  25. idle = b[0];
  26. for (int i = 1 ; i < c ; i++)
  27. if (idle < b[i]) idle = b[i];
  28. ans[x] = idle;
  29.  
  30. }
  31.  
  32. for (int i = 0 ; i < n ; i++) printf("Case #%d : %d\n", i+1, ans[i]);
  33.  
  34.  
  35. return 0;
  36. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement