Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 16 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 3 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 2 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.007 s | 13 KBi |
#10 |
Correcto
|
0.008 s | 1 KBi |
#11 |
Correcto
|
0.01 s | 15 KBi |
#12 |
Correcto
|
0.008 s | 1 KBi |
#13 |
Correcto
|
0.007 s | 2 KBi |
#14 |
Correcto
|
0.007 s | 2 KBi |
#15 |
Correcto
|
0.006 s | 2 KBi |
#16 |
Correcto
|
0.006 s | 1 KBi |
#17 |
Correcto
|
0.012 s | 1 KBi |
#18 |
Correcto
|
0.011 s | 2 KBi |
#19 |
Correcto
|
0.009 s | 2 KBi |
#20 |
Correcto
|
0.012 s | 14 KBi |
#include <iostream> #include <map> using namespace std; const int N = 1000+10; int a[N]; int main(){ ios::sync_with_stdio(0); cin.tie(0); int n; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++){ for(int j=0;j<i; j++){ if(a[i] < a[j]){ swap(a[i], a[j]); } } } for(int i=0;i<n;i++){ cout<<a[i]<<" "; } cout<<endl; return 0; }