hdu4176 水题

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define maxn 1000
int a[maxn];
int main()
{
    int i,j,t,n,ff=;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        int maxx=;
        for(i=;i<n;i++)
        {
            if(a[i]-a[i-]>maxx)
                maxx=a[i]-a[i-];
        }
        printf("Class %d\n",++ff);
        printf("Max %d, Min %d, Largest gap %d\n",a[n-],a[],maxx);
    }
}