Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 2 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.004 s | 2 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.007 s | 2 KBi |
#8 |
Correcto
|
0.006 s | 18 KBi |
#9 |
Correcto
|
0.009 s | 2 KBi |
#10 |
Correcto
|
0.006 s | 20 KBi |
#11 |
Correcto
|
0.007 s | 2 KBi |
#12 |
Correcto
|
0.011 s | 1 KBi |
#13 |
Correcto
|
0.01 s | 17 KBi |
#14 |
Correcto
|
0.008 s | 1 KBi |
#15 |
Correcto
|
0.009 s | 14 KBi |
#16 |
Correcto
|
0.008 s | 2 KBi |
#17 |
Correcto
|
0.009 s | 2 KBi |
#18 |
Correcto
|
0.009 s | 2 KBi |
#19 |
Correcto
|
0.008 s | 2 KBi |
#20 |
Correcto
|
0.008 s | 1 KBi |
/// Write by Daniel Perez .PERAPRO #include<bits/stdc++.h> using namespace std; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using vi=vector<int>; #define pb push_back typedef long long ll; void merge(int l, int r, vi &v){ if(l==r){ return; } merge(l,(l+r)/2,v); merge((l+r)/2+1,r,v); queue<int> pi; queue<int> pd; for(int i=l;i<=(r+l)/2;i++){ pi.push(v[i]); } for(int i=(r+l)/2+1;i<=r;i++) { pd.push(v[i]); } for(int i=l;i<=r;i++){ if(pd.size() && pi.size()){ if(pd.front()>pi.front()){ v[i]=pi.front(); pi.pop(); }else{ v[i]=pd.front(); pd.pop(); } }else if(pd.size()){ v[i]=pd.front(); pd.pop(); }else{ v[i]=pi.front(); pi.pop(); } } } int main(){ fast_io; int n; cin>>n; vi v(n); for(int i=0;i<n;i++) cin>>v[i]; merge(0,n-1,v); cout<<v[0]; for(int i=1;i<n;i++) cout<<" "<<v[i]; cout<<endl; }