Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 17 KBi |
#3 |
Correcto
|
0.004 s | 4 KBi |
#4 |
Correcto
|
0.004 s | 2 KBi |
#5 |
Correcto
|
0.003 s | 0 KBi |
#6 |
Correcto
|
0.006 s | 2 KBi |
#7 |
Correcto
|
0.007 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.003 s | 2 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.003 s | 0 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#include <iostream> #define ll long long using namespace std; int orden(ll arr[], int len){ for (int i = 1; i < len; i++){ if(arr[i-1] > arr[i]){ cout << "Desordenado"; return -1; } } cout << "Ordenado" << endl; return 1; } int main(){ int n; cin >> n; ll a[n]; for (int i = 0; i < n; i++){ cin >> a[i]; } orden(a, n); return 0; }