#include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int T;
int N;
int A[202], dp[2][404];
int z[1000];
int main()
{
scanf("%d", &T);
while(T--)
{
scanf("%d", &N);
for(int i=1; i<=N; i++)
scanf("%d", &A[i]);
sort(A+1, A+N+1);
for(int i=1; i<=N; i++)
{
dp[i % 2][0] = INF;
for(int j=1; j<=N+N; j++)
{
dp[i % 2][j] = min(dp[i-1 % 2][j-1] + abs(A[i]-j), dp[i % 2][j-1]);
}
}
printf("%d\n", dp[N % 2][N+N]);
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAojZGVmaW5lIElORiAxMjM0NTY3ODkwCiNkZWZpbmUgbGwgbG9uZyBsb25nCiAKaW50IFQ7CmludCBOOwppbnQgQVsyMDJdLCBkcFsyXVs0MDRdOwppbnQgelsxMDAwXTsKIAppbnQgbWFpbigpCnsKCXNjYW5mKCIlZCIsICZUKTsKCXdoaWxlKFQtLSkKCXsKCQlzY2FuZigiJWQiLCAmTik7CgkJZm9yKGludCBpPTE7IGk8PU47IGkrKykKCQkJc2NhbmYoIiVkIiwgJkFbaV0pOwoJCXNvcnQoQSsxLCBBK04rMSk7CgkJZm9yKGludCBpPTE7IGk8PU47IGkrKykKCQl7CgkJCWRwW2kgJSAyXVswXSA9IElORjsKCQkJZm9yKGludCBqPTE7IGo8PU4rTjsgaisrKQoJCQl7CgkJCQlkcFtpICUgMl1bal0gPSBtaW4oZHBbaS0xICUgMl1bai0xXSArIGFicyhBW2ldLWopLCBkcFtpICUgMl1bai0xXSk7CgkJCX0KCQl9CgkJcHJpbnRmKCIlZFxuIiwgZHBbTiAlIDJdW04rTl0pOwoJfQoJcmV0dXJuIDA7Cn0=