Submission #1307396

---

Source Code Expand

def sorting(lst):
	if len(lst) < 2:
		return lst
	else:
		tmp = lst[0]
		left = []
		right = []
		for i in range(1, len(lst)):
			if lst[i][1] > tmp[1]:
				left.append(lst[i])
			else:
				right.append(lst[i])
		newleft = sorting(left)
		newright = sorting(right)
		newleft.append(tmp)
		newleft.extend(newright)

		return newleft
			

n = int(raw_input())
inpt = map(int, raw_input().split())

student = []

for i in range(0, n):
	student.append([i+1, inpt[i]])

anslist = sorting(student)

for i in range(0, n):
	print anslist[i][0]

Submission Info

Judge Result