[5, 3, 4]
2 & nbsp;
6
EN
RU
EN
RU
import heapq
# Ввод данных
clients = [int(c) for c in input().strip('[]').split(',') if c.strip().isdigit()]
num_counters = int(input())
# Если список клиентов пустой, выводим 0
if not clients:
print(0)
else:
# Создаем список для касс (время обслуживания на каждой), изначально 0
counters = [0] * num_counters
heapq.heapify(counters) # Преобразуем в кучу
# Распределяем клиентов по кассам
for time in clients:
current = heapq.heappop(counters) # Берем кассу с минимальным временем
current += time # Добавляем время клиента
heapq.heappush(counters, current) # Возвращаем в кучу
# Выводим максимальное время среди касс
print(max(counters))
1 - Read the task and understand what needs to be done
2 - The example shows how the input data will be provided and what output is expected
3 - Write the code considering the input, output, and the task itself.
1 - The “Run” button executes your code only on one set of input data, and you’ll see the result in the output window.
2 - The “Test on All Cases” button runs your code against all test cases. If all tests pass, a banner will appear. If even one test fails, it will be highlighted in red.
To change the input data, click the “Run Test” button next to the input data you want to execute.
1 - Input Data is the window containing the values loaded into your program in place of input()
2 - Program Output is the window showing what your program prints. If it’s green, the output matches the expected result; if red, there are differences.
3 - Expected Output is the reference value used to verify the solution.
1 - Green means the program produced the correct output
2 - Red means the program’s output didn’t match the expected output for this data. The program output and the expected output must be identical, including spaces and punctuation!
If you see this banner, congratulations — everything is correct.
1 - The first 10 tasks are quite easy and contain hints covering only the essential parts of the topic.
2 - The next 10 tasks are medium difficulty. Their hints differ from the easy ones and reveal new aspects of the topic.
3 - The hardest tasks have no hints. Often, they include additional topics, so sometimes it’s better to move on and return later. Read the hints carefully — they offer new ways to solve already familiar problems.
1 - Each block contains a “Theory” section.
2 - It always includes a detailed video.
3 - There is also a detailed guide with all the necessary theory and code examples.
1 - Click the “Report an Error / Social Media” button
2 - Here you can describe the error you encountered.
3 - You’ll also find our social media links here — follow us and help us improve.
🎉 Congratulations! 🎉
You did an excellent job with the task! It was a challenging problem, but you found the correct solution. You are one step closer to mastering programming! Keep up the good work, because every stage you pass makes you even stronger.
AD
Advertisement
Running your code...