// 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;
}
Ly8gSW5zZXJ0aW9uU29ydAogCiNpbmNsdWRlIDxzdGRpby5oPgojaW5jbHVkZSA8c3RkbGliLmg+CiAKdm9pZCBwcmludEEoaW50IGFbXSwgaW50IG4pewogICAgaW50IGk7CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHByaW50ZigiJWQgIixhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKfQogCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9CiAKdm9pZCBJbnNlcnRpb25Tb3J0KGludCBhW10sIGludCBuKXsKCS8v44GT44GT44KS5pu444GPCglpbnQgKmI7CgliPShpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKzEpOwoJZm9yKGludCBlPTA7ZTxuO2UrKyl7CgkJYltlXT1hW2VdOwoJfQoJcHJpbnRmKCIlZG5pIixiWzNdKTsKCWludCBjPTA7CglpbnQgZD0xOwogCglpbnQqIGg7CglpbnQqIHQ7CgkqaD1iW2NdOwoJKnQ9YltkXTsKCXN3YXAoKmgsKnQpOwogCgkvKmZvcihpbnQgaT0wO2k8aDtpKyspewoJYltuKzFdPWJbbl07CgluLS07Cgl9Ki8KCQlhWzBdPWJbMF07CiAKCXByaW50ZigiJWRuaSIsYVswXSk7Cn0KIAppbnQgbWFpbih2b2lkKXsKICAgIGludCBuLGk7CiAgICBpbnQgKnY7CiAgICBzY2FuZigiJWQiLCZuKTsKICAgIHYgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CiAgICBpZih2PT1OVUxMKXsKICAgICAgICBwcmludGYoIkVSUk9SXG4iKTsKICAgICAgICByZXR1cm4gLTE7CiAgICB9CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHNjYW5mKCIlZCIsJnZbaV0pOwogICAgfQogICAgSW5zZXJ0aW9uU29ydCh2LG4pOwogICAgcHJpbnRBKHYsbik7CiAgICBmcmVlKHYpOwogICAgcmV0dXJuIDA7Cn0KIAo=