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 | #!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'getMinCost' function below.
#
# The function is expected to return a LONG_INTEGER.
# The function accepts following parameters:
# 1. INTEGER_ARRAY crew_id
# 2. INTEGER_ARRAY job_id
#
def getMinCost(crew_id, job_id):
crew_id.sort()
job_id.sort()
return sum(abs(c - j) for c, j in zip(crew_id, job_id))
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
crew_id_count = int(input().strip())
crew_id = []
for _ in range(crew_id_count):
crew_id_item = int(input().strip())
crew_id.append(crew_id_item)
job_id_count = int(input().strip())
job_id = []
for _ in range(job_id_count):
job_id_item = int(input().strip())
job_id.append(job_id_item)
result = getMinCost(crew_id, job_id)
fptr.write(str(result) + '\n')
fptr.close()
|
