Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 3 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 7 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.007 s | 18 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.006 s | 1 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.006 s | 1 KBi |
#16 |
Correcto
|
0.006 s | 1 KBi |
#17 |
Correcto
|
0.008 s | 2 KBi |
#18 |
Correcto
|
0.006 s | 1 KBi |
#19 |
Correcto
|
0.007 s | 1 KBi |
#20 |
Correcto
|
0.007 s | 1 KBi |
#include <iostream> #include <algorithm> // std::max #include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int array[N]; for(int i = 0;i<N;i++) { cin >> array[i]; } //burbuja for(int i = 0;i<N;i++){ for(int j = i;j<N;j++){ if(array[i] > array[j]){ int aux = array[i]; array[i] = array[j]; array[j] = aux; } } } for(int i = 0;i<N;i++) cout << array[i] << " "; return 0; }