33 lines
573 B
C++
33 lines
573 B
C++
|
#include<bits/stdc++.h>
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
#define PRINT_VEC(vec){\
|
||
|
|
cout<<#vec<<" [";\
|
||
|
|
for(size_t i=0;i<vec.size();i++){\
|
||
|
|
cout<<vec[i]<<(i!=vec.size()-1?",":"]\n");\
|
||
|
|
}\
|
||
|
|
}
|
||
|
|
|
||
|
|
void sort_fix(vector<int> &v){
|
||
|
|
for(size_t i=1;i<v.size();i++){
|
||
|
|
int key=v[i];
|
||
|
|
int j=i-1;
|
||
|
|
while(j>0&&v[j]>key){
|
||
|
|
v[j+1]=v[j];
|
||
|
|
--j;
|
||
|
|
}
|
||
|
|
v[j+1]=key;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
int main(){
|
||
|
|
unsigned int n;
|
||
|
|
cin>>n;
|
||
|
|
vector<int> v(n);
|
||
|
|
for(int &i:v){
|
||
|
|
cin>>i;
|
||
|
|
}
|
||
|
|
PRINT_VEC(v)
|
||
|
|
sort_fix(v);
|
||
|
|
PRINT_VEC(v)
|
||
|
|
}
|