Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 16 KBi |
#4 |
Correcto
|
0.009 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 2 KBi |
#6 |
Correcto
|
0.006 s | 4 KBi |
#7 |
Correcto
|
0.006 s | 45 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.027 s | 19 KBi |
#12 |
Correcto
|
0.038 s | 17 KBi |
#13 |
Correcto
|
0.037 s | 16 KBi |
#14 |
Correcto
|
0.025 s | 1 KBi |
#15 |
Correcto
|
0.024 s | 2 KBi |
#16 |
Correcto
|
0.012 s | 1 KBi |
#17 |
Correcto
|
0.019 s | 12 KBi |
#18 |
Correcto
|
0.015 s | 9 KBi |
#19 |
Correcto
|
0.029 s | 1 KBi |
#20 |
Correcto
|
0.019 s | 1 KBi |
// #include <bits/stdc++.h> using namespace std; #define INF 1000000000 #define MOD 1000000007 #define PI 3.14159265 #define EPS 1e-9 #define Pi acos(-1.0) typedef pair<int, int> ii; typedef long long ll; typedef vector<ll> vll; typedef pair<ll,ll> pll; #define forr(i,a,b) for(int i=(a); i<(b); i++) #define clean(arr,val) memset(arr,val,sizeof(arr)) #define forn(i,n) forr(i,0,n) #define PB push_back typedef vector<int> vi; typedef vector<ii> vii; typedef vector<pll> vpll; /*CODE START HERE*/ int n; vi a; void bubble(vi &v){ forn(i,n){ forn(j,n-1){ if(v[j] >= v[j+1]) swap(v[j], v[j+1]); } } } int main(){ ios::sync_with_stdio(0); cin >> n; a.assign(n,0); forn(i,n){ cin >> a[i]; } bubble(a); cout << a[0]; forr(i,1,n){ cout << " " << a[i]; } cout << "\n"; return 0; }