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 | #!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'minTime' function below.
#
# The function is expected to return a LONG_INTEGER.
# The function accepts following parameters:
# 1. INTEGER_ARRAY files
# 2. INTEGER numCores
# 3. INTEGER limit
#
def minTime(files, numCores, limit):
x = []
y = []
for f in files:
if f % numCores == 0:
x.append(f)
else:
y.append(f)
x.sort(reverse=True)
return (sum(x[:limit]) // numCores) + sum(x[limit:]) + sum(y)
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
files_count = int(input().strip())
files = []
for _ in range(files_count):
files_item = int(input().strip())
files.append(files_item)
numCores = int(input().strip())
limit = int(input().strip())
result = minTime(files, numCores, limit)
fptr.write(str(result) + '\n')
fptr.close()
|
