D.新居规划 贪心

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 5e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}


int n,q,m;


struct Node{
	int a,b;
	bool operator<(const Node&W)const{
		return a-b>W.a-W.b;
	}
}node[N];


int s[N];
void solve()
{
	cin>>n>>m;
	int res1 = 0;
	for(int i=1;i<=n;i++){
		cin>>node[i].a>>node[i].b;
		res1+=node[i].b;
	}
	
	sort(node+1,node+1+n);
	for(int i=1;i<=n;i++)s[i] = s[i-1]+node[i].a-node[i].b;
	
	int res = 0;
	if(n+n-1<=m)res = res1;
	

	for(int i=2;i<=n;i++){
		if(n*2-i>m)continue;
		int t = s[i];
		res = max(res,res1+t);
	}
	
	cout<<res<<"\n";
	
	


}

signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	cin>>_;
	//_ = 1;
	while(_--)solve();
	return 0;
}