题解 | #找最小数#

#include <iostream>
#include <algorithm>

using namespace std;

struct couple{
	int x;
	int y;
}c[100];

int n;

bool cmp(couple a,couple b){
	if(a.x == b.x){
		return a.y < b.y;
	}else {
		return a.x < b.x;
	}
}
int main(){
	while(cin >> n){
		for(int i = 0;i < n;i ++)cin >> c[i].x >> c[i].y;
		sort(c,c + n,cmp);
		cout << c[0].x << " " << c[0].y;
	}	
	return 0;
}