40ptsWA+MLE大佬求调

#include<bits/stdc++.h>
using namespace std;
int n,m,k;
int a,b,c;
long long t;
int s[3333];
priority_queue<int>q;
int ans=0;
signed main()
{
    cin>>n>>m>>k;
    cin>>a>>b>>c;;
    cin>>t;
    for(int i=1;i<=m;i++)
    {
        cin>>s[i];
    }
    k-=m;
    for(int i=1;i<m;i++)
    {
        int jj=s[i+1],flag=0;
        for(int j=s[i];j<jj;)
        {
            if(t-(s[i]-1)*b-(j-s[i])*c<0)
            {
                break;
            }
            int ss=(t-(s[i]-1)*b-(j-s[i])*c)/a+1;
            if(j+ss>=jj)
            {
                ss=jj-j;
                j=jj;
            }
            j+=ss;
            if(!flag)
            {
                ans+=ss;
                flag=1;
            }
            else
            {
                q.push(ss);
            }
        }
    }
    if(t>=(n-1)*b)ans++;
    while(!q.empty()&&k)
    {
		k--;
		ans+=q.top();
		q.pop();
	}
    cout<<ans-1;
    return 0;
}