Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Incorrecto
|
0.005 s | 2 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 6 KBi |
#7 |
Correcto
|
0.005 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 4 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#include <iostream> #include <vector> using namespace std; int main() { int n, input, i; cin >> n; vector <int> vec; for (i = 0; i < n ; i++) { cin >> input; vec.push_back(input); } i = 0; while (vec[i] && i < n - 1) { if (vec[i] <= vec[i+1]) vec[i] = vec[i+1]; else { cout << "Desordenado" << endl; return (0); } i++; } cout << "Ordenado" << endl; return (0); }