Pagini recente » Cod sursa (job #2627987) | Cod sursa (job #887102) | Cod sursa (job #400549) | Cod sursa (job #2474265) | Cod sursa (job #2606740)
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
ifstream fin("algsort.in"); ofstream fout("algsort.out");
int t, n;
vector<ll> a;
int bs( int l, int r, int x ){
int m=(l+r)/2;
if(l==r){return m;}
if(a[m]>=x ){return bs(l, m, x); }
else{ return bs(m+1, r, x); }
}
int32_t main(){
INIT
fin>>n;
for(int i=0; i<n; i++){
int x;
fin>>x;
int c=bs(0, a.size(), x);
vector<int> b; b.pb(x);
a.insert(a.begin()+c, b.begin(), b.end() );
}
for(int i=0; i<n; i++){
fout<<a[i]<<" ";
}
return 0;
}