裁剪网格纸

题目描述
度度熊有一张网格纸，但是纸上有一些点过的点，每个点都在网格点上，若把网格看成一个坐标轴平行于网格线的坐标系的话，每个点可以用一对整数x，y来表示。度度熊必须沿着网格线画一个正方形，使所有点在正方形的内部或者边界。然后把这个正方形剪下来。问剪掉正方形的最小面积是多少。
输入描述:
第一行一个数n(2≤n≤1000)表示点数，接下来每行一对整数xi,yi(－1e9<=xi,yi<=1e9)表示网格上的点
输出描述:
一行输出最小面积

测试通过30%

#include <iostream>
#include <cmath>
#include<limits.h>
#include<vector>
using namespace std;
int main()
{
   int n;
    int min1 = INT_MAX;
    int min2 = INT_MAX;
    int max1 = INT_MIN;
    int max2 = INT_MIN;
    while(cin >> n)
    {
        vector<int> xx(n,0);
        vector<int> yy(n,0);
        for(int i = 0;i < n;++i)
        {
            cin >>xx[i] >> yy[i];
           max1=max(max1,xx[i]);
           max2=max(max2,yy[i]);
           min1=min(min1,xx[i]);
           min2=min(min2,yy[i]);
        }
        int bian = max(max1-min1,max2-min2);
        cout << bian*bian << endl;

    }
    return 0;
}

测试通过

#include <iostream>
#include <cmath>
#include<limits.h>
#include<vector>
using namespace std;
int main()
{
    int n;

    while(cin >> n)
    {
        int min1 = INT_MAX;
        int min2 = INT_MAX;
        int max1 = INT_MIN;
        int max2 = INT_MIN;
        vector<int> xx(n,0);
        vector<int> yy(n,0);
        for(int i = 0;i < n;++i)
        {
            cin >>xx[i];
            cin >> yy[i];
            min1 = min(xx[i],min1);
            max1 = max(xx[i],max1);
            min2 = min(yy[i],min2);
            max2 = max(yy[i],max2);
        }
        int bian = max(max1-min1,max2-min2);
        cout << bian*bian << endl;

    }
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    while(cin >> n)
    { 
        vector<int> gridX;
        vector<int>  gridY;
        while(n-- >0)
        {
            int x,y;
            cin >> x >> y;
            gridX.push_back(x);
            gridY.push_back(y);
        }
        sort(gridX.begin(),gridX.end());
        sort(gridY.begin(),gridY.end());
        int edge = max(gridX.back() - gridX.front() ,gridY.back() - gridY.front());
        cout << edge*edge<<endl;
    }
}