代码
#include<iostream>
using namespace std;
const int MAXN=100000;
int reso[MAXN]={0};
int main()
{
int n,k;
int m;
cin>>n>>m>>k;
int t[n+1];
int c[n+1];
int num=0;
int tMax=0;
for(int i=1;i<=n;i++)
{
cin>>t[i]>>c[i];
reso[t[i]]+=c[i];
if(tMax<t[i])
{
tMax=t[i];
}
}
int x;
for(x=tMax;x>k;x--)
{
if(reso[x]>m)
{
break;
}
m-=reso[x];
reso[x-1]+=reso[x];
}
cout<<x;
return 0;
}