Advertisement
jbn6972

Untitled

Aug 14th, 2022
135
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.76 KB | None | 0 0
  1. #Code Written by : John Nixon
  2. #Date: 06:08:2022  Time: 14:49:32
  3. #Copyrights are applicable
  4. import sys
  5. import os
  6. sys.setrecursionlimit(10000)
  7. try:
  8.     sys.stdin = open('./input.txt', 'r')
  9.     sys.stdout = open('./output.txt', 'w')
  10. except:
  11.     pass
  12.  
  13. T = int(input())
  14. for _ in range(T):
  15.     n = int(input())
  16.     arr = list(map(int,input().split()))
  17.  
  18.     arr.sort()
  19.  
  20.     mid = 0
  21.     diff = 0
  22.     for i in range(1,n):
  23.         curr = arr[i] - arr[i-1]
  24.  
  25.         if curr > diff:
  26.             diff = curr
  27.             mid = i
  28.  
  29.     # print(mid)
  30.     sub1 = sum(arr[:mid])
  31.     sub2 = sum(arr[mid:])
  32.     x = sub1 //mid
  33.     y = sub2 // (n-mid)
  34.     # print(x,y)
  35.     ans = 0
  36.     for i in range(n):
  37.         ans += min(abs(arr[i]-x),abs(arr[i]-y))
  38.  
  39.     print(ans)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement