UVA - 299 - Train Swapping

#include<stdio.h>
int main()
{
    int a[100],n,m,k;
    int i,j,max=0,count=0;
    scanf("%d",&m);
    for(k=0; k<m; k++)
    {
        count=0;
        scanf("%d",&n);
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=0; i<n-1; i++)
        {
            for(j=1; j<n; j++)
            {
                if(a[i]>a[j])
                {
                    max=a[i];
                    a[i]=a[j];
                    a[j]=max;
                    count++;
                }
            }
        }
        printf("Optimal train swapping takes %d swaps.\n",count);
    }
    return 0;
}