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