Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<cstdio>
- #include<iostream>
- using namespace std;
- int main()
- {
- int k,n,beg,end=0,wyn,tab[100000],ile;
- scanf("%d%d",&n,&k);
- for(int i=0;i<n;i++)
- {
- scanf("%d",&tab[i]);
- end+=tab[i];
- }
- beg=end/(k+1);
- k++;
- // printf("! %d %d\n",beg,end);
- int mid;
- while(beg<end)
- {
- mid=(beg+end+1)/2;
- wyn=1;
- ile=0;
- for(int i=0;i<n;i++)
- {
- ile+=tab[i];
- if(ile>mid)
- {
- ile=tab[i];
- wyn++;
- }
- }
- if(wyn==k)break;
- if(wyn>k)beg=mid;
- if(wyn<k)end=mid-1;
- // printf("%d %d %d %d\n",beg,end,mid,wyn);
- }
- printf("%d ",end);
- return 0;
- }
Add Comment
Please, Sign In to add comment