// BucketSort
#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;
}
#define MAX 1000000
void BucketSort(int a[], int n){
int i,t;
int b[MAX];
//ここから下を書く
for(i = 0; i < MAX; i++){
b[i] = 0;
}
for(i = 0; i < n; i++){
t = a[i];
b[t] = 1;
}
int x = 0;
for(i = 0; i < MAX; i++){
if(b[i] == 1){
a[x] = i;
x++;
}
}
}
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++){
}
BucketSort(v,n);
printA(v,n);
return 0;
}
Ly8gQnVja2V0U29ydAojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgoKdm9pZCBwcmludEEoaW50IGFbXSwgaW50IG4pewogICAgaW50IGk7CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHByaW50ZigiJWQgIixhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKfQoKdm9pZCBzd2FwKGludCogYSwgaW50KiBiKXsKICAgIGludCAgdG1wOwogICAgdG1wID0gKmE7CiAgICAqYSA9ICpiOwogICAgKmIgPSB0bXA7Cn0KCiNkZWZpbmUgTUFYIDEwMDAwMDAKdm9pZCBCdWNrZXRTb3J0KGludCBhW10sIGludCBuKXsKICAgIGludCBpLHQ7CiAgICBpbnQgYltNQVhdOwogICAgLy/jgZPjgZPjgYvjgonkuIvjgpLmm7jjgY8KICAgIGZvcihpID0gMDsgaSA8IE1BWDsgaSsrKXsKICAgICAgICBiW2ldID0gMDsKICAgIH0KICAgIGZvcihpID0gMDsgaSA8IG47IGkrKyl7CiAgICAgICAgdCA9IGFbaV07CiAgICAgICAgYlt0XSA9IDE7CiAgICB9CiAgICBpbnQgeCA9IDA7CiAgICBmb3IoaSA9IDA7IGkgPCBNQVg7IGkrKyl7CiAgICAgICAgaWYoYltpXSA9PSAxKXsKICAgICAgICAgICAgYVt4XSA9IGk7CiAgICAgICAgICAgIHgrKzsKICAgICAgICB9CiAgICB9Cn0KCmludCBtYWluKHZvaWQpewogICAgaW50IG4saTsKICAgIGludCAqdjsKICAgIHNjYW5mKCIlZCIsJm4pOwogICAgdiA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKICAgIGlmKHY9PU5VTEwpewogICAgICAgIHByaW50ZigiRVJST1JcbiIpOwogICAgICAgIHJldHVybiAtMTsKICAgIH0KICAgIGZvcihpPTA7aTxuO2krKyl7CiAgICAgICAgc2NhbmYoIiVkIiwmdltpXSk7CiAgICB9CiAgICBCdWNrZXRTb3J0KHYsbik7CiAgICBwcmludEEodixuKTsKICAgIGZyZWUodik7CiAgICByZXR1cm4gMDsKfQo=