Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.009 s | 2 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 0 KBi |
#4 |
Correcto
|
0.006 s | 2 KBi |
#5 |
Correcto
|
0.006 s | 2 KBi |
#6 |
Incorrecto
|
0.005 s | 1 KBi |
#7 |
Incorrecto
|
0.002 s | 0 KBi |
#8 |
Incorrecto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Incorrecto
|
0.002 s | 0 KBi |
#12 |
Incorrecto
|
0.002 s | 0 KBi |
#include <bits/stdc++.h> #include <math.h> using namespace std; bool isSorted(int n, int arr[]) { if(n == 0 || n == 1) return true; for(int i = 1; i < n; i++) { if(arr[i-1] > arr[i]) return false; } return true; } int main() { int n; cin>>n; int arr[n]; for(int i = 0; i < n; ++i) { cin>>arr[n]; } if(isSorted(n, arr)) cout<<"Ordenado"<<endl; else cout<<"Desordenado"<<endl; return 0; }