Competitive_Programming/Solution_CodeVita_SpecialArray.py at master · sujoy-coder/Competitive_Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
def myFunc(array):
    ans = 0
    length = len(array)
    #for odd....
    if length%2!=0:
        mid_index = (length//2)
        for i in range(0,length):
            if i < mid_index:
                ans = ans + (array[mid_index]-array[i])
            else:
                ans = ans + (array[i]-array[mid_index])
    #for even....
    else:
        mid_index = int(length/2)
        for i in range(0,length):
            if i < mid_index:
                ans = ans + (array[mid_index]-array[i])
            else:
                ans = ans + (array[i]-array[mid_index])
    return ans
def sorting(array):
    n = len(array)
    for i in range(n-1):
        for j in range(0, n-i-1):
            if array[j] > array[j+1] :
                array[j], array[j+1] = array[j+1], array[j]

test = int(input())
ls = []
demo = 0
if test>=1 and test<=10:
    for i in range(1,test+1):
        sizeOfarray = int(input())
        if sizeOfarray>=1 and sizeOfarray<=10000:
            print()
            array = list()
            for j in range(sizeOfarray):
                val = int(input())
                if val>=1 and val<=10000:
                    array.append(val)
                else:
                    demo = 1

                    break
            if demo==0:
                sorting(array)
                ls.append(myFunc(array))
        else:
            demo = 1

            break
else:
    demo = 1


if demo==0:

    for value in ls:
        print(value,end=" ")