Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 2 KBi |
#2 |
Correcto
|
0.005 s | 35 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.007 s | 72 KBi |
#5 |
Correcto
|
0.005 s | 21 KBi |
#6 |
Correcto
|
0.005 s | 27 KBi |
#7 |
Correcto
|
0.007 s | 2 KBi |
#8 |
Correcto
|
0.008 s | 2 KBi |
#9 |
Correcto
|
0.008 s | 2 KBi |
#10 |
Correcto
|
0.007 s | 2 KBi |
#11 |
Correcto
|
0.01 s | 3 KBi |
#12 |
Correcto
|
0.006 s | 2 KBi |
#13 |
Correcto
|
0.013 s | 1 KBi |
#14 |
Correcto
|
0.005 s | 2 KBi |
#15 |
Correcto
|
0.005 s | 15 KBi |
#16 |
Correcto
|
0.006 s | 11 KBi |
#17 |
Correcto
|
0.01 s | 3 KBi |
#18 |
Correcto
|
0.006 s | 4 KBi |
#19 |
Correcto
|
0.008 s | 2 KBi |
#20 |
Correcto
|
0.013 s | 31 KBi |
#include <bits/stdc++.h> using namespace std; int main() { int N, i, j, k; fscanf(stdin, " %d", &N); vector<int> arr; int n; fscanf(stdin, " %d", &n); arr.push_back(n); for (i = 1; i < N; i++) { int num; fscanf(stdin, " %d", &num); arr.push_back(num); k = arr.size() - 2; while (k >= 0 && arr[k] > num) { arr[k + 1] = arr[k]; k--; } arr[k + 1] = num; } for (i = 0; i < N; i++) { printf("%d ", arr[i]); } }