k = []

s = []

a = 0

b = 0

c = 0

line = input().strip().split()

n = int(line[0])

m = int(line[1])

j = (m * 3)//2

if n >= j:

for i in range(0, n):
    b = input().strip().split()
    k.append(int(b[0]))
    s.append(int(b[1]))
for g in range(0, n-1):
    for i in range(0, n-1):
        if s[i] < s[i+1]:
            a = s[i]
            s[i] = s[i+1]
            s[1+i] = a
            b = k[i]
            k[i] = k[i+1]
            k[i+1] = b
        if s[i] == s[i+1]:
            if k[i] > k[i+1]:
                b = k[i]
                k[i] = k[i + 1]
                k[i+1] = b
for y in range(j-1, n-1):
    if s[j-1] == s[j]:
        j = j + 1
c = int(s[j-1])
print(c, j)
for i in range(0, j):
    print(k[i], s[i])

大佬救我，冒泡为啥TLE?怎么排能减时间？