好难啊!
查看原帖
好难啊!
1767636
while0718楼主2025/8/31 19:46
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

struct node {
	int a, b;
} a[20000000000005];

bool cmp(node x, node y) {
	return x.b < y.b;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, s;
	cin >> n >> s;
	for (int i = 0; i < n; i++) {
		cin >> a[i].a >> a[i].b;
	}
	sort(a,a+n,cmp);



	return 0;
}

//之后没思路了 @所有人

2025/8/31 19:46
加载中...