@@ -0,0 +1,1389 @@
+//https://www.hackerrank.com/contests/101sep14/challenges/jim-and-the-orders%0Aimport java.io.*;%0Aimport java.util.*;%0A%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        StringBuffer sb = new StringBuffer();%0A        %0A        //INPUT%0A        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));%0A        final short N = Short.parseShort(br.readLine());%0A        final Node%5B%5D nodes = new Node%5BN%5D;%0A        for(short i = 0; i %3C N; ++i)%7B%0A            final String%5B%5D input = br.readLine().split(%22 %22);%0A            final int T = Integer.parseInt(input%5B0%5D);%0A            final int D = Integer.parseInt(input%5B1%5D);%0A            nodes%5Bi%5D = new Node(i+1, T + D);%0A        %7D%0A        %0A        //SOLVE%0A        Arrays.sort(nodes, new Comparator%3CNode%3E()%7B%0A            public int compare(Node a, Node b)%7B%0A                return (a.data %3C b.data) ? -1 :%0A                        (a.data %3E b.data) ? 1 :%0A                        (a.id %3C b.id) ? -1 : 1;%0A            %7D%0A        %7D);%0A        %0A        //OUTPUT%0A        for(int i = 0; i %3C N; ++i)%7B%0A            sb.append(nodes%5Bi%5D.id).append(%22 %22);%0A        %7D%0A        System.out.print(sb);%0A    %7D%0A    %0A    public static class Node%7B%0A        final public int id;%0A        final public int data;%0A        public Node(final int id, final int data)%7B%0A            this.id = id;%0A            this.data = data;%0A        %7D%0A    %7D%0A%7D%0A

Create jim-and-the-orders.java