Minimum Cost - TreeSet - Java code study - HackerRAnk woman codesprint #2 -

MinimumCost_TreeSet_studycode2.java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int numYears = sc.nextInt();
        long[] data = new long[numYears];
        for (int i = 0; i < numYears; i++) {
            data[i] = sc.nextLong();
        }
        TreeSet<Long> values = new TreeSet<>();
        long best = Long.MAX_VALUE;
        for (int i = numYears-1; i >= 0; i--) {
            Long smaller = values.floor(data[i]);
            if (smaller != null) {
                long diff = (data[i] - smaller);
                if (diff >= 0) {
                    best = Math.min(best, diff);
                }
            }
            values.add(data[i]);
        }
        System.out.println(best);
    }
}