题解 | #why买外卖#

#include<bits/stdc++.h>
#define int   long long

using namespace std;
using pii = pair<int,int>;

template<typename T>
using vec = vector<T>;

void solve(){
	int n,m;
	cin>>n>>m;
	vec<pii>t(n);
	for(auto&[a,b]:t)
		cin>>a>>b;
	sort(t.begin(),t.end());
	vec<int>p(n,t[0].second);
	for(int i = 1;i<n;i++)
		p[i] = p[i - 1] + t[i].second;
	int ans = m;
	for(int i = 0;i<n;i++){
		if(m + p[i] >=t[i].first){
			ans = max(ans,m + p[i]);
		}
	}
	cout<<ans<<"\n";
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;cin>>t;
	while(t--)
		solve();

	return 0;
}