Advertisement
Morass

Vitos Familly

Jan 10th, 2016
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.86 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define PB push_back
  4. #define ZERO (1e-10)
  5. #define INF (1<<30)
  6. #define CL(A,I) (memset(A,I,sizeof(A)))
  7. #define DEB printf("DEB!\n");
  8. #define D(X) cout<<"  "<<#X": "<<X<<endl;
  9. #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
  10. typedef long long ll;
  11. typedef pair<ll,ll> pll;
  12. typedef vector<int> vi;
  13. typedef pair<int,int> ii;
  14. #define IN(n) int n;scanf("%d",&n);
  15. #define FOR(i, m, n) for (int i(m); i < n; i++)
  16. #define REP(i, n) FOR(i, 0, n)
  17. #define F(n) REP(i, n)
  18. #define FF(n) REP(j, n)
  19. #define FT(m, n) FOR(k, m, n)
  20. #define aa first
  21. #define bb second
  22. void ga(int N,int *A){F(N)scanf("%d",A+i);}
  23. #define MX (1<<14)
  24. int S,A[MX],M;
  25. int main(void){
  26.     IN(tt)F(tt){
  27.         IN(N)S=0;
  28.         ga(N,A);
  29.         sort(A,A+N);
  30.         M=A[N>>1];
  31.         F(N)S+=abs(M-A[i]);
  32.         printf("%d\n",S);
  33.     }
  34.     return 0;
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement