题解 | #最小长方形#

#include<iostream>
using namespace std;
int main()
{
    int x[50];
    int y[50];
    int min_x=0,max_x=0,max_y=0,min_y=0;
    int i=0;
    int count_0=0;
        
        
        while(cin>>x[i]>>y[i])
        {
            
            if(x[i]==0&&y[i==0])
            {
                i=0;
                count_0++;
                cout<<min_x<<" "<<min_y<<" "<<max_x<<" "<<max_y<<endl;
                continue;
                
            }
            if(count_0==2)
            {
                break;
            }
            
            if(i==0)
            {
                min_x=max_x=x[0];
                min_y=max_y=y[0];
            }
            
            min_x=min(min_x,x[i]);
            min_y=min(min_y,y[i]);
            max_x=max(max_x,x[i]);
            max_y=max(max_y,y[i]);
            i++;
                    
        }
        
        
        
        
    
            
        
        
}