def top_95(x):
    x.sort(key=lambda y : y[1], reverse=True)
    k = 0
    cnt = 0
    for el in x:
        cnt += el[1]
        if cnt > 0.95:
            break
        k += 1
    if k == 0:
        return list(x[0][1])
    return [elem[0] for elem in x[:k]]