题解 | #找最小数#

#include<iostream>
#include<algorithm>
using namespace std;
typedef struct
{
	int x;
	int y;
}T;
bool compx(T left, T right)
{
	if (left.x < right.x)
	{
		return true;
	}
	else if (left.x == right.x)
	{
		if (left.y < right.y)
		{
			return true;
		}
		else return false;
	}
	else return false;
}
int main()
{
	T arr[100];
	int n;
	while (cin >> n)
	{
		for (int  i = 0; i < n; i++)
		{
			cin >> arr[i].x >> arr[i].y;
		}
		sort(arr,arr+n,compx);
		cout << arr[0].x << " " << arr[0].y << endl;
	}
	return 0;
}