hdu 2078 複習時間

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

int main()
{
    int t;
    int n, m;
    int a[101];
    int max;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d", &n, &m);
        for(int i=0; i<n; i++)
            scanf("%d", &a[i]);
        sort(a, a+n);

        max = (100-a[0])*(100-a[0]) > (a[0] - a[n-1]) * (a[0] - a[n-1]) ? (100-a[0])*(100-a[0]) : (a[0] - a[n-1]) * (a[0] - a[n-1]);
        printf("%d\n", max);
    }
}