WA on #4，和第二篇题解对拍跑不出来 hack 数据，求大佬找错或帮忙给能 hack 的数据

#include<cstdio>
using namespace std;
long long l,k,x[100001],ansmin,ansmax;
inline void Read(long long *p)
{
    *p=0;
    bool f=0;
    char c=getchar();
    while(c<'0'||c>'9')
        f|=c=='-',c=getchar();
    while(c>='0'&&c<='9')
        *p=*p*10+c-'0',c=getchar();
    if(f)
        *p=-*p;
}
long long Check(long long n)
{
    long long k=0;
    for(long long i=1,sum=0;i<=l;++i)
    {
        sum+=x[i];
        if(sum<0)
            sum=0;
        if(sum>=n)
            sum=0,++k;
    }
    return k;
}
int main()
{
    // freopen("P4343.in","r",stdin);
    // freopen("P4343.out","w",stdout);
    long long i;
    Read(&l);Read(&k);
    for(i=1;i<=l;++i)
        Read(x+i);
    long long l=1,r=9e18;
    while(l+1<r)
    {
        long long mid=(l+r+1)>>1,check=Check(mid);//printf("%d %d %d:%d\n",l,r,mid,check);
        if(check<k)
            r=mid-1;
        else if(check==k)
            r=mid;
        else
            l=mid;
    }
    ansmin=r;
    l=1,r=9e18;
    while(l+1<r)
    {
        long long mid=(l+r)>>1,check=Check(mid);
        if(check<k)
            r=mid;
        else if(check==k)
            l=mid;
        else
            l=mid+1;
    }
    ansmax=l;
    if(Check(ansmin)==k&&Check(ansmax)==k)
        printf("%lld %lld",ansmin,ansmax);
    else
        printf("-1");
    return 0;
}