제출 #1201009

#제출 시각아이디문제언어결과실행 시간메모리
1201009ofozLet's Win the Election (JOI22_ho_t3)Pypy 3
10 / 100
219 ms51468 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: break
        a, j = start[i]
        if vis[j]: continue
        vis[j] = 1
        time += a/(col+1)
        votes += 1
    

    res = min(res, time)

assert res != float('inf')
print(res)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 30%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...