Järjestys

mx = int(input())

s = input().split(" ")
arr = []
editArr = []
counter = 0

for obj in s:
    arr.append(int(obj))

sortedArr = []
sortedArr = arr[:]
sortedArr.sort()

def findBiggest(a):
    _biggest = 0
    for obj in a:
        _biggest = max(_biggest, obj)
    return _biggest

def lol():
    counter = 0
    tempBiggest = 0
    tempArr = arr[:]
    sumstr = ""

    while True:

        tempBiggest = findBiggest(tempArr)

        if tempBiggest == 1:
            return [sumstr, counter]

        indxOfTheBiggest = tempArr.index(tempBiggest)

        if indxOfTheBiggest == tempArr.__len__() - 1:
            tempArr.remove(tempBiggest)
            tempBiggest = 0

        elif indxOfTheBiggest != 0:
            a, b = indxOfTheBiggest, 0
            tempArr[a], tempArr[b] = tempArr[b], tempArr[a]
            sumstr += str(a) + " "
            counter += 1

        if indxOfTheBiggest == 0:
            a, b = 0, tempArr.__len__() - 1
            tempArr[a], tempArr[b] = tempArr[b], tempArr[a]
            sumstr += str(b) + " "
            counter += 1



a, b = lol()

print(b)
print(a)

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED