// 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;
t=0;
}
for(i=0; i<MAX; i++){
if(b[i]==1){
static int j=0;
a[j]=i;
j+=1;
}
}
}
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;
}
Ly8gQnVja2V0U29ydAojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgoKdm9pZCBwcmludEEoaW50IGFbXSwgaW50IG4pewogICAgaW50IGk7CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHByaW50ZigiJWQgIixhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKfQoKdm9pZCBzd2FwKGludCogYSwgaW50KiBiKXsKICAgIGludCAgdG1wOwogICAgdG1wID0gKmE7CiAgICAqYSA9ICpiOwogICAgKmIgPSB0bXA7Cn0KCiNkZWZpbmUgTUFYIDEwMDAwMDAKdm9pZCBCdWNrZXRTb3J0KGludCBhW10sIGludCBuKXsKICAgIGludCBpLHQ7CiAgICBpbnQgYltNQVhdOwoJCglmb3IoaT0wOyBpPE1BWDsgaSsrKXsKCQliW2ldPTA7Cgl9Cglmb3IoaT0wOyBpPG47IGkrKyl7CgkJdD1hW2ldOwoJCWJbdF09MTsKCQl0PTA7Cgl9Cglmb3IoaT0wOyBpPE1BWDsgaSsrKXsKCQlpZihiW2ldPT0xKXsKCQkJc3RhdGljIGludCBqPTA7CgkJCWFbal09aTsKCQkJais9MTsKCQl9Cgl9Cn0KCmludCBtYWluKHZvaWQpewogICAgaW50IG4saTsKICAgIGludCAqdjsKICAgIHNjYW5mKCIlZCIsJm4pOwogICAgdiA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKICAgIGlmKHY9PU5VTEwpewogICAgICAgIHByaW50ZigiRVJST1JcbiIpOwogICAgICAgIHJldHVybiAtMTsKICAgIH0KICAgIGZvcihpPTA7aTxuO2krKyl7CiAgICAgICAgc2NhbmYoIiVkIiwmdltpXSk7CiAgICB9CiAgICBCdWNrZXRTb3J0KHYsbik7CiAgICBwcmludEEodixuKTsKICAgIGZyZWUodik7CiAgICByZXR1cm4gMDsKfQo=