Järjestys

n = int(input())
t = [int(i) for i in input().split(" ")]
pairs = zip(t, list(range(1, n+1)))
sor = sorted(pairs)
pairs = zip(*pairs)
order = list(zip(*sor))[1]
 
adjust = [0]*(n+1)
for x in t:
	i = 0
	while t[i] != x:
		if t[i] > x:
			adjust[x] += 1
		i+=1
 
res = ""
m = 0
for x in reversed(order):
	print(str(x) + " " + str(t[x-1]))
	a = x-adjust[t[x-1]]
	if (a > 1):
		res += str(a-1) +" "+ str(a) +" "
		m += 2
	if (n > 1):	
		res += str(n) +" "+ str(n-1) +" "
		m += 2
	n -= 1
print(m)
print(res[:-1])

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED