Envío 7243
Problema 0xdd - Ordenar un arreglo pequeño
- Autor: Jorgito
- Fecha: 2024-02-19 23:20:08 UTC (Hace 10 meses)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Incorrecto
|
0.008 s | 3 KBi |
| #2 |
Incorrecto
|
0.011 s | 3 KBi |
| #3 |
Incorrecto
|
0.012 s | 3 KBi |
| #4 |
Incorrecto
|
0.009 s | 3 KBi |
| #5 |
Incorrecto
|
0.01 s | 3 KBi |
| #6 |
Incorrecto
|
0.011 s | 3 KBi |
| #7 |
Incorrecto
|
0.012 s | 3 KBi |
| #8 |
Incorrecto
|
0.013 s | 3 KBi |
| #9 |
Incorrecto
|
0.012 s | 3 KBi |
| #10 |
Incorrecto
|
0.009 s | 3 KBi |
| #11 |
Incorrecto
|
0.04 s | 3 KBi |
| #12 |
Incorrecto
|
0.043 s | 3 KBi |
| #13 |
Incorrecto
|
0.062 s | 3 KBi |
| #14 |
Incorrecto
|
0.034 s | 3 KBi |
| #15 |
Incorrecto
|
0.042 s | 3 KBi |
| #16 |
Incorrecto
|
0.069 s | 3 KBi |
| #17 |
Incorrecto
|
0.068 s | 3 KBi |
| #18 |
Incorrecto
|
0.078 s | 3 KBi |
| #19 |
Incorrecto
|
0.051 s | 3 KBi |
| #20 |
Incorrecto
|
0.05 s | 3 KBi |
Puntos totales: 0 / 100
Código
def sort(lista):
n = len(lista)
for i in range(n):
for j in range(0, n-i-1):
if lista[j] > lista[j+1]:
lista[j], lista[j+1] = lista[j+1], lista[j]
return lista
n = int(input())
lista = [int(n) for n in input().split()]
sort(lista)