Project Euler & HackerRank problem 99 solution: Find the largest exponential among thousands of base/exponent pairs.

Project-Euler-Problem-99.py

from math import log
v = []
for _ in range(int(input())):
    b, e = map(int, input().split())
    v.append((e * log(b), b, e))

k = int(input())-1
b, e = sorted(v)[k][1:3]
print (b, e)