Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 3 KBi |
#6 |
Correcto
|
0.005 s | 2 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#include <iostream> using namespace std; #define ll long long int main() { ll n, curr, last; bool isSorted = true; cin >> n >> last; for(int i = 1; i < n && isSorted; ++i) { cin >> curr; if(curr < last) isSorted = false; last = curr; } if(isSorted) cout << "Ordenado" << endl; else cout << "Desordenado" << endl; return 0; }