_13-二维向量优先队列

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

struct cmp //重写仿函数
{
	bool operator() (vector<int> a, vector<int> b)
	{
		return a[0] < b[0]; 
	}
};

int main() {
	int n, m, l,c,d;
	int ans = 0, max = 0;
	cin >> n >> m >> l;
	vector<vector<int> >a(m);
	for (int i = 0; i < a.size(); i++)
		a[i].resize(2);
	for (int i = 0; i < m; i++) {
		cin >> c >> d;
		a[i][0] = c;
		a[i][1] = d;
	}
	priority_queue<vector<int>, vector<vector<int> >, cmp>q;
	for(int i=0;i<m;i++)
		q.push(a[i]);
	return 0;
}

ps:用优先队列想查看是否排序成功，不能从调试里面看，要打印出来。（2022.4.11