// 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 *b;
b
=(int*)malloc(sizeof(int)*n
+1); for(int e=0;e<n;e++){
b[e]=a[e];
}
int c=0;
int d=1;
int* h;
int* t;
*h=b[c];
*t=b[d];
swap(*h,*t);
/*for(int i=0;i<h;i++){
b[n+1]=b[n];
n--;
}*/
a[0]=b[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/jgZPjgZPjgpLmm7jjgY8KCWludCAqYjsKCWI9KGludCopbWFsbG9jKHNpemVvZihpbnQpKm4rMSk7Cglmb3IoaW50IGU9MDtlPG47ZSsrKXsKCQliW2VdPWFbZV07Cgl9CgkKCWludCBjPTA7CglpbnQgZD0xOwoKCWludCogaDsKCWludCogdDsKCSpoPWJbY107CgkqdD1iW2RdOwoJc3dhcCgqaCwqdCk7CglwcmludGYoIiVkbmkiLGJbMF0pOwoJLypmb3IoaW50IGk9MDtpPGg7aSsrKXsKCWJbbisxXT1iW25dOwoJbi0tOwoJfSovCgkJYVswXT1iWzBdOwoJCglwcmludGYoIiVkbmkiLGFbMF0pOwp9CgppbnQgbWFpbih2b2lkKXsKICAgIGludCBuLGk7CiAgICBpbnQgKnY7CiAgICBzY2FuZigiJWQiLCZuKTsKICAgIHYgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CiAgICBpZih2PT1OVUxMKXsKICAgICAgICBwcmludGYoIkVSUk9SXG4iKTsKICAgICAgICByZXR1cm4gLTE7CiAgICB9CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHNjYW5mKCIlZCIsJnZbaV0pOwogICAgfQogICAgSW5zZXJ0aW9uU29ydCh2LG4pOwogICAgcHJpbnRBKHYsbik7CiAgICBmcmVlKHYpOwogICAgcmV0dXJuIDA7Cn0K