Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.114 s | 41 KBi |
#2 |
Incorrecto
|
0.11 s | 16 KBi |
#3 |
Incorrecto
|
0.152 s | 14 KBi |
#4 |
Incorrecto
|
0.132 s | 14 KBi |
#5 |
Incorrecto
|
0.149 s | 14 KBi |
#6 |
Incorrecto
|
0.103 s | 32 KBi |
#7 |
Incorrecto
|
0.136 s | 14 KBi |
#8 |
Incorrecto
|
0.109 s | 16 KBi |
#9 |
Incorrecto
|
0.13 s | 19 KBi |
#10 |
Incorrecto
|
0.136 s | 13 KBi |
#11 |
Incorrecto
|
0.155 s | 13 KBi |
#12 |
Incorrecto
|
0.157 s | 13 KBi |
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = scanner.nextInt(); } boolean sorted = true; for (int i = 0; i + 1 < n; i++) { if (!(a[i] <= a[i + 1])) { sorted = false; break; } } System.out.println(sorted); } }