Envío 1929

Código

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try {
            Scanner input = new Scanner(System.in);
            int c = input.nextInt();
            // o(n^2)
            for (int caseNumber = 1; caseNumber <= c; caseNumber++) {
                System.out.print("Case #" + caseNumber + ":");
                int n = input.nextInt();
                int[] arrayHigh = new int[n];
                for (int buildingNumber = 0; buildingNumber < n; buildingNumber++) {
                    arrayHigh[buildingNumber] = input.nextInt();
                }
                for (int i = 0; i < n; i++) {
                    int answer = -1;
                    for (int j = i+1; j < n; j++) {
                        if (arrayHigh[i] < arrayHigh[j]) {
                            answer = arrayHigh[j];
                            break;
                        }
                    }
                    System.out.print(" " + answer);
                }
                System.out.println();
            }
        } catch (Exception e) {
            System.out.println(e);
        }
    }
}