// InsertionSort
#include <stdio.h>
#include <stdlib.h>
void printA(int a[], int n){
int i;
for(i=0;i<n;i++){
}
}
void swap(int* a, int* b){
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void InsertionSort(int a[], int n){
//ここを書く
int s;
for(int g=2;g<n;g++){
s=a[g];
for(int y=1;y<n;y++){
if(a[y-1]<s){
if(s<a[y]){
for(int o=g;o>y;o--)
a[o]=a[o-1];
swap(&s,&a[y]);
}
}else{
if(a[0]>s){
for(int o=g;o>0;o--)
a[o]=a[o-1];
swap(&s,&a[0]);
}
}
}
}
}
int main(void){
int n,i;
int *v;
v
= (int*)malloc(sizeof(int)*n
); if(v==NULL){
return -1;
}
for(i=0;i<n;i++){
}
InsertionSort(v,n);
printA(v,n);
return 0;
}
Ly8gSW5zZXJ0aW9uU29ydAoKI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCnZvaWQgcHJpbnRBKGludCBhW10sIGludCBuKXsKICAgIGludCBpOwogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBwcmludGYoIiVkICIsYVtpXSk7CiAgICB9CiAgICBwcmludGYoIlxuIik7Cn0KCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9Cgp2b2lkIEluc2VydGlvblNvcnQoaW50IGFbXSwgaW50IG4pewoJLy/jgZPjgZPjgpLmm7jjgY8KCWludCBzOwoJZm9yKGludCBnPTI7ZzxuO2crKyl7CgkJCXM9YVtnXTsKCQkJZm9yKGludCB5PTE7eTxuO3krKyl7CgkJCWlmKGFbeS0xXTxzKXsKCQkJCWlmKHM8YVt5XSl7CgkJCQkJZm9yKGludCBvPWc7bz55O28tLSkKCQkJCQlhW29dPWFbby0xXTsKCQkJCQlzd2FwKCZzLCZhW3ldKTsKCQkJCX0KCQkJCX1lbHNlewoJCQkJCWlmKGFbMF0+cyl7CgkJCQkJCWZvcihpbnQgbz1nO28+MDtvLS0pCgkJCQkJYVtvXT1hW28tMV07CgkJCQkJc3dhcCgmcywmYVswXSk7CgkJCQkJfQoJCQkJfQoJCQl9Cn0KfQppbnQgbWFpbih2b2lkKXsKICAgIGludCBuLGk7CiAgICBpbnQgKnY7CiAgICBzY2FuZigiJWQiLCZuKTsKICAgIHYgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CiAgICBpZih2PT1OVUxMKXsKICAgICAgICBwcmludGYoIkVSUk9SXG4iKTsKICAgICAgICByZXR1cm4gLTE7CiAgICB9CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHNjYW5mKCIlZCIsJnZbaV0pOwogICAgfQogICAgSW5zZXJ0aW9uU29ydCh2LG4pOwogICAgcHJpbnRBKHYsbik7CiAgICBmcmVlKHYpOwogICAgcmV0dXJuIDA7Cn0K