#include<bits/stdc++.h> using namespace std; struct node{ int y, m; }; bool cmp(node x, node z){ if(x.y==z.y){ return x.m<z.m; } return x.y<z.y; } int main(){ int n; cin>>n; vector<node> a(n); for(int i=0;i<n;i++){ cin>>a[i].y>>a[i].m; } sort(a.begin(),a.end(),cmp); for(int i=0;i<n;i++){ cout<<a[i].y<<" "<<a[i].m<<endl; } return 0; }

基础结构体+判断条件，个人认为应该放T3

#include<iostream> #include<map> using namespace std; struct node{ int d,t; bool operator<(const node &o) const{ if(d != o.d) return d < o.d; return t < o.t; } }; map<node,int> mp; int n; int main(){ cin >> n; while(n--){ int x,y; cin >> x >> y; if(mp.count({x,y})) mp[{x,y}]++; else mp[{x,y}] = 1; } for(auto &it : mp){ while(it.second--) cout << it.first.d << " " << it.first.t << endl; } return 0; }