Problem:
Counting Sort

Counting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:

Counting-Sort(A, B, k)
1 for i = 0 to k
2 do C[i] = 0
3 for j = 1 to length[A]
4 do C[A[j]] = C[A[j]]+1
5 /* C[i] now contains the number of elements equal to i */
6 for i = 1 to k
7 do C[i] = C[i] + C[i-1]
8 /* C[i] now contains the number of elements less than or equal to i */
9 for j = length[A] downto 1
10 do B[C[A[j]]] = A[j]
11 C[A[j]] = C[A[j]]-1

Write a program which sorts elements of given array ascending order based on the counting sort.

Input

The first line of the input includes an integer n, the number of elements in the sequence.

In the second line, n elements of the sequence are given separated by spaces characters.

Output

Print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

Constraints

1 ≤ n ≤ 2,000,000

0 ≤ A[i] ≤ 10,000

Sample Input 1

7
2 5 1 3 2 3 0

Sample Output 1

0 1 2 2 3 3 5

Solution in JAVA (judge verdict: Accepted)

import java.util.*;
import java.io.*;

public class Main implements Runnable {
    public static int[] CountingSort(int[] X, int n) {
        int k = X.length;
        int[] Y = new int[k];
        int[] Z = new int[n];
        
        for(int i = 0; i < k; i++) {
            Z[X[i]]++;
        }
        
        for(int i = 1; i < n; i++) {
            Z[i] += Z[i - 1];
        }
        
        for(int j = k - 1; j >= 0; j--) {
            Y[Z[X[j]] - 1] = X[j];
            Z[X[j]]--;
        }
        return Y;
    } 
    
    public void run() {
        FastScanner scanner = new FastScanner();
        int k = (int) scanner.nextLong();
        int[] A = new int[k];
        
        for(int i = 0; i < k; i++) {
            A[i] = (int) scanner.nextLong();
        }
        
        int[] B = CountingSort(A, 10001);
        StringBuilder answer = new StringBuilder();
        
        for(int i = 0; i < k; i++) {
            answer.append(B[i]);
            if(i == k - 1) {
                answer.append("\n");
            } else {
                answer.append(" ");
            }
        }
        System.out.print(answer);
    }
    
    public static void main(String[] args) {
        new Thread(null, new Main(), "", 128 * 1024 * 1024).start();
    }
} 

class FastScanner {
    private final InputStream input = System.in;
    private final byte[] buffer     = new byte[1024];
    private int ptr    = 0;
    private int buflen = 0;
    
    private boolean hasNextByte() {
        if(ptr < buflen) {
            return true;
        } else {
          ptr = 0;
          try {
              buflen = input.read(buffer);
          } catch(IOException e) {
              e.printStackTrace();
          }
          if(buflen <= 0) {
              return false;
          }
        }
        return true;
    }
    
    private int readByte() {
        if(hasNextByte()) return buffer[ptr++];
        else return -1;
    }
    
    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }
    
    private void skipUnprintable() {
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }
    
    public boolean hasNext() {
        skipUnprintable();
        return hasNextByte();
    }
    
    public String next() {
        if(!hasNext()) throw new NoSuchElementException();
        StringBuilder strBuilder = new StringBuilder();
        int b = readByte();
        
        while(isPrintableChar(b)) {
            strBuilder.appendCodePoint(b);
            b = readByte();
        }
        
        return strBuilder.toString();
    }
    
    public long nextLong() {
        if(!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if(b == '-') {
            minus = true;
            b = readByte();
        }
        
        if(b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        
        while(true) {
            if('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            }else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
}