Submission #39868335

---

Source Code Expand

import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
import bisect
n, m, k = mi()
AB = [li() for _ in range(n)]
CD = [li() for _ in range(m)]

def check(x):
    ans = 0
    A = []
    for i in range(n):
        ai, bi = AB[i]
        A.append((100 - x) * ai - x * bi)
    B = []
    for j in range(m):
        cj, dj = CD[j]
        B.append((x - 100) * cj + x * dj)
    A.sort()
    B.sort()
    for v in A:
        ans += bisect.bisect_left(B, v)
    
    return ans >= k

ng = 100 - 10 ** (-15)

ok = 10 ** (-15)

for _ in range(60):
    mid = (ok + ng) / 2
    if check(mid):
        ok = mid
    else:
        ng = mid
print(ok)

Submission Info

Judge Result