Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 0 KBi |
#2 |
Correcto
|
0.001 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.005 s | 0 KBi |
#5 |
Correcto
|
0.006 s | 0 KBi |
#6 |
Correcto
|
0.006 s | 0 KBi |
#7 |
Correcto
|
0.007 s | 0 KBi |
#8 |
Correcto
|
0.005 s | 0 KBi |
#9 |
Correcto
|
0.006 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.003 s | 0 KBi |
#12 |
Correcto
|
0.004 s | 0 KBi |
#include<bits/stdc++.h> using namespace std; #define el "\n" #define forn(n) for(int i = 0; i < n; ++i) int main() { int n; cin>>n; vector<int>v(n); forn(n){ cin>>v[i]; } bool ordenado = true; forn(n - 1){ if(v[i] > v[i + 1]){ ordenado = false; break; } } ordenado ? cout<<"Ordenado"<<el : cout<<"Desordenado"<<el; return 0; }