299-Train swapping

#include<iostream>
using namespace std;
int main()
{
    int t,n,i,j,tem,c;
    cin>>t;
    while(t--)
    {
        cin>>n;
    int a[n];
    for(i=0;i<n;i++)
        cin>>a[i];
    c=0;
    for(i=0;i<n;i++)
    {
      for(j=i+1;j<n;j++)
      {
        if(a[j]<a[i])
         {
                tem=a[j];
                a[j]=a[i];
                a[i]=tem;
                c++;
         }
      }
    }
       cout<<"Optimal train swapping takes"<<" "<<c<<" "<<"swaps."<<endl;
    }
return 0;
}