优先队列解贪心封神

#include 
#include 
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
LL T, n, m;
struct node
{
	LL ti, hi, z;
	friend bool operator < (node a, node b)
	{
		return a.hi < b.hi;
	}
}enemy[N];

priority_queue > pq;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> T;
	while (T--)
	{
		while (!pq.empty())
			pq.pop();
		cin >> n >> m;
		for (int i = 1; i <= n; ++i)
		{
			cin >> enemy[i].ti >> enemy[i].hi;
			enemy[i].hi = min(enemy[i].hi, m);
			enemy[i].z = enemy[i].hi - enemy[i].ti;
		}
		
		LL mm = m;
		for (int i = 1; i <= n; ++i)
		{
			if (enemy[i].z >= 0)
				m += enemy[i].z;
			else 
				pq.push(enemy[i]);
		}		
		int flag = 1;
		while (!pq.empty())
		{
			node temp = pq.top();
			if (m >= temp.ti)
			{
				m += temp.z;
				pq.pop();
			}
			else if (m < temp.ti)
			{
				flag = 0;
				break;
			}
		}
		if (flag)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
 	return 0;
}