Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 2 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.005 s | 2 KBi |
#10 |
Correcto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.011 s | 1 KBi |
#12 |
Correcto
|
0.009 s | 1 KBi |
#13 |
Correcto
|
0.012 s | 1 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.004 s | 2 KBi |
#16 |
Correcto
|
0.006 s | 1 KBi |
#17 |
Correcto
|
0.017 s | 1 KBi |
#18 |
Correcto
|
0.008 s | 2 KBi |
#19 |
Correcto
|
0.009 s | 1 KBi |
#20 |
Correcto
|
0.012 s | 2 KBi |
#include<bits/stdc++.h> using namespace std; int main(){ int n; scanf(" %d",&n); int nums[n]; for(int i = 0; i < n;++i) scanf(" %d",&nums[i]); for(int i = 1; i < n;++i){ int t = i; while(t && nums[t] < nums[t-1]){ swap(nums[t],nums[t-1]); --t; } } for(int i = 0; i < n;++i){ printf("%d",nums[i]); if(i != n-1) printf(" "); } puts(""); return 0; }