二分70分求大佬帮忙

#include <iostream>
#include <vector>
using namespace std;

int n,k;
vector<int> nums;
long long minans=-1,maxans=-1,l,r,mid;

long long int judge(int x){
    long long int ans=0,sum=0;
    for(int i=0;i<n;i++){
        sum+=nums[i];
        if(sum<0) sum=0;
        if(sum>=x){
            ans++;
            sum=0;
        }
    }
    return ans;
}

int main(){
    cin>>n>>k;
    int temp;
    for(int i=0;i<n;i++){
        cin>>temp;
        nums.push_back(temp);
    }
    l=1;
    r=1000000000;
    while(l<=r){
        mid=(l+r)/2;
        if(judge(mid)<=k){
            r=mid-1;
            if(judge(mid)==k)minans=mid;
        }
        else{
            l=mid+1;
        }
    }
    l=1;
    r=1000000000;
    while(l<=r){
        mid=(l+r)/2;
        if(judge(mid)>=k){
            l=mid+1;
            if(judge(mid)==k) maxans=mid;
        }
        else{
            r=mid-1;
        }
    }
    if(minans==-1||maxans==-1){
        cout<<-1<<endl;
    }
    else{
        cout<<minans<<' '<<maxans<<endl;
    }
    return 0;
}