题解 | #最小长方形#

#include<iostream>
#include<algorithm>

const int MAX = 1000;

int main()
{
    long long int X[MAX], Y[MAX];
    long long int x, y;
    int cnt = 0;
    int i = 0, j = 0;
    while (std::cin >> x >> y)
    {
        if(x == 0 && y == 0) break;
        X[i++] = x;
        Y[j++] = y;
        cnt++;
    }
    std::sort(X, X + cnt);
    std::sort(Y, Y + cnt);
    std::cout << X[0] << " " << Y[0] << " " << X[cnt-1] << " " << Y[cnt-1] << std::endl;
}