复习时间

n=m=2
1 a 52
2 b  25

a>b
(a-b)2=b1      27*27
(100-a)2=a1   48*48
max=a1+b1 

n=3 m=2
1 a 
2 b
3 c

从大到小排序  a>b>c

a,b a,c b,c


n=3 m=3

a,b,c
(100-a)2=a1
(a-b)2=b1 --->(100-b)2=b2
(b-c)2=c1 
(100-b)2=b2
max=a1+b2+c1
n=40 m=26

a-z 
max=(100-a)2+(100-b)2+(100-c)2+...+(100-y)2+(y-z)2<(100-z)2    公式1

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>

int main(void)
{
    int t;
    scanf_s("%d", &t);
    while (t>0)
    {
        int N;
        int M;
        scanf_s("%d %d", &N, &M);
        int i;
        int min=100;
        int a;
        for (i = 0; i < N; i++)
        {
            scanf_s("%d", &a);
            if (min > a)
                min = a;
        }
        
        printf("%d\n",(100-min)*(100-min));
        t--;
    }
    return 0;
}