在希尔排序的基础上,对数组(w0,id0)进行排序,先排权重w,再排id.
n=int(input())
w=[]
for _ in range(n):
id0,w0=map(int,input().split())
w.append((w0,id0))
def shell_sort(a):
gap=n//2
while gap>0:
for i in range(gap,n):
tmp=a[i]
j=i
while j-gap>=0 and a[j-gap]>tmp:
a[j]=a[j-gap]
j-=gap
a[j]=tmp
gap//=2
return a
w=shell_sort(w)
for i in w:
print(i[1])