题解 | #找最小数#

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=1000;
struct group{
	int x;
	int y;
};
bool compare(group a,group b){
	if(a.x==b.x) return a.y<b.y;
	else return a.x<b.x;
}
group arr[MAXN];
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>arr[i].x>>arr[i].y;
	}
	sort(arr,arr+n,compare);
	cout<<arr[0].x<<" "<<arr[0].y;
	
	return 0;
}