public class Solution { public static void main(String[] args) { Scanner sc = new Scanner (System.in); int n = sc.nextInt(); TreeSet t = new TreeSet(); for (int i = 0; i < n; i++) { int value; int command = sc.nextInt(); %3D if (command == 1) { value = sc.nextInt(); t.add (value); } else if (command == 2) { value = sc.nextInt(); t.remove(value); } else if (command == 3) { System.out.println(t.first()); } } }

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.