一个都过不了求助大佬

#include<bits/stdc++.h>
using namespace std;
int n,m,fenshuxian,b,jishu=0;
int k[6001],s[6001];
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    cin>>n>>m;
    fenshuxian=1.5*m;
    fenshuxian=floor(fenshuxian);
    for(int i=1;i<=n;i++)
    {
        cin>>k[i]>>s[i];
        b=i;
    }
    sort(s,s+b,cmp);
    cout<<m<<" ";
    for(int i=1;i<=n;i++)
    {
        if(s[i]>=fenshuxian)
        {
            jishu++;
        }
    }
    cout<<jishu<<endl;
    for(int i=1;i<=n;i++)
    {
        if(s[i]>=fenshuxian)
        {
            cout<<k[i]<<" "<<s[i]<<endl;
        }
    }
    return 0;
}
如题！膜拜大佬！