-
Notifications
You must be signed in to change notification settings - Fork 22
/
ample-syrup.py
30 lines (26 loc) · 811 Bytes
/
ample-syrup.py
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
# Copyright (c) 2017 kamyu. All rights reserved.
#
# Google Code Jam 2017 Round 1C - Problem A. Ample Syrup
# https://code.google.com/codejam/contest/3274486/dashboard#s=p0
#
# Time: O(NlogK)
# Space: O(K)
#
from math import pi
from heapq import heappush, heappop
def ample_syrup():
N, K = map(int, raw_input().strip().split())
Ps = []
for i in xrange(N):
Ps.append(map(int, raw_input().strip().split()))
Ps.sort()
result, min_heap = 0, []
for P in Ps:
if len(min_heap) == K-1:
result = max(result, P[0] * P[0] + 2 * P[0] * P[1] + sum(min_heap))
heappush(min_heap, 2 * P[0] * P[1])
if len(min_heap) >= K:
heappop(min_heap)
return result * pi
for case in xrange(input()):
print 'Case #%d: %s' % (case+1, ample_syrup())