访问-1下标了怎么办

#include <bits/stdc++.h>
using namespace std;

int n,x[110000],y[110000];
long long m,s[110000],mn=1e18,ans;

int main(){
    cin >> n >> m;

    for (int i=1; i<=n; i++)  cin >> x[i] >> y[i], mn=min(mn,1ll*x[i]+y[i]);

    sort(x+1,x+n+1);

    for (int i=0; i<=n; i++){
        s[i]=s[i-1]+x[i];

        if(s[i]>m)  break;

        ans=max(ans,i+(m-s[i])/mn*2);
    }

    cout << ans;
    
    return 0;
}