Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.022 s | 3 KBi |
#2 |
Incorrecto
|
0.023 s | 3 KBi |
#3 |
Incorrecto
|
0.025 s | 3 KBi |
#4 |
Incorrecto
|
0.026 s | 3 KBi |
#5 |
Incorrecto
|
0.025 s | 3 KBi |
#6 |
Incorrecto
|
0.024 s | 4 KBi |
#7 |
Incorrecto
|
0.026 s | 3 KBi |
#8 |
Incorrecto
|
0.02 s | 3 KBi |
#9 |
Incorrecto
|
0.025 s | 3 KBi |
#10 |
Incorrecto
|
0.02 s | 3 KBi |
def solve_horizon(input_list): if len(input_list) == 0: return case_list = [] copy_list = input_list.copy() for idx, num in enumerate(input_list): if num == max(copy_list) or idx == len(input_list) - 1: copy_list.remove(num) case_list.append(-1) else: for idx2, num2 in enumerate(input_list): if idx2 > idx and num < num2: case_list.append(num2) break return case_list if __name__ == "__main__": n = int(input()) input_list = input().split() solve = solve_horizon(input_list) for idx, num in enumerate(solve): if idx != n: print(num, end=' ') else: print(num)