Minimum Cost - HackerRank - woman codesprint#2 - TreeSet

MinimumCost_studycode_TreeSet_1.java

import java.io.*;
import java.util.*;
public class b {
public static void main(String[] args) throws IOException {
	input.init(System.in);
	PrintWriter out = new PrintWriter(System.out);
	int n = input.nextInt();
	long[] ps = new long[n];
	for(int i = 0; i<n; i++) ps[i] = input.nextLong();
	long res = (long)1e18;
	TreeSet<Long> set = new TreeSet<Long>();
	for(int i = 0; i<n; i++)
	{
		set.add(ps[i]);
		if(set.higher(ps[i]) != null) res = Math.min(res, set.higher(ps[i]) - ps[i]);
	}
	out.println(res);
	out.close();
}

public static class input {
	static BufferedReader reader;
	static StringTokenizer tokenizer;

	static void init(InputStream input) {
		reader = new BufferedReader(new InputStreamReader(input));
		tokenizer = new StringTokenizer("");
	}

	static String next() throws IOException {
		while (!tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(reader.readLine());
		return tokenizer.nextToken();
	}

	static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
}
}