# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1201003 | ofoz | Let's Win the Election (JOI22_ho_t3) | Pypy 3 | 155 ms | 51636 KiB |
n = int(input())
k = int(input())
start = []
end = []
for i in range(n):
a, b = map(int, input().split(" "))
start.append((a, i))
if b != -1: end.append((b, i))
start.sort()
end.sort()
res = float('inf')
for t in range(n+1):
vis = [0] * n
votes = col = time = 0
for i in range(len(end)):
if col >= t: break
b, j = end[i]
vis[j] = 1
time += b/(col+1)
col += 1
votes += 1
if col < t: continue
for i in range(n):
if votes >= k: continue
a, j = start[i]
if vis[j]: continue
vis[j] = 1
time += a/(col+1)
votes += 1
res = min(res, time)
print(res)
Compilation message (stdout)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |