求助RE

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
    int est,c,sc,s[10010],pr[10010],p,w[10010],i=0,b,d,minn=99999;
    int slt=0;
    double k;
    memset(s,0,sizeof(s));
    cin>>est;
    cin>>c>>sc;
    pr[0]=c;s[c]=sc;
    do{
        i++;
        cin>>pr[i];cin>>s[pr[i]];
    }while(pr[i]!=-1 && s[pr[i]]!=-1);
    cin>>b;
    sort(pr,pr+i);
    for(int j=1;j<i;j++)
    {
        k=(s[pr[j]]-s[pr[j-1]])/(pr[j]-pr[j-1]);
        for(int h=pr[j-1]+1;h<pr[j];h++)
        s[h]=s[pr[j-1]]+k*(h-pr[j-1]);
    }
    p=c;
    for(;;)
    {
        p++;
        if(s[p]!=0) 
        {
            w[p]=(p-c)*s[p];
        }
        else
        {
            s[p]=s[p-1]-b;
            if(s[p]<=0) break;
            w[p]=(p-c)*s[p];
        }        
    }
    for(d=c-est;d<p-c;d++)
    {
        if(w[est]+d*s[est]>w[est-1]+d*s[est-1] && w[est]+d*s[est]>w[est+1]+d*s[est+1]) 
        {
            if(abs(d)<minn)
            {
                if(d>=0) slt=1;
                else slt=-1;
            }
            minn=min(minn,abs(d));
        }
    }
    if(slt==1) cout<<minn;
    if(slt==-1) cout<<"-"<<minn;
    if(slt==0)
    cout<<"NO SOLUTION";
    return 0;
}