Class Set

src/class185/Code07_HideSeek1.java:21–66

public class Code07_HideSeek1 {

	static class Set {
		PriorityQueue<Integer> addHeap;
		PriorityQueue<Integer> delHeap;

		public Set() {
			addHeap = new PriorityQueue<>((a, b) -> b.compareTo(a));
			delHeap = new PriorityQueue<>((a, b) -> b.compareTo(a));
		}

		void clean() {
			while (!delHeap.isEmpty() && delHeap.peek().equals(addHeap.peek())) {
				addHeap.poll();
				delHeap.poll();
			}
		}

		int popHead() {
			int ans = addHeap.poll();
			clean();
			return ans;
		}

		int size() {
			return addHeap.size() - delHeap.size();
		}

		void add(int v) {
			addHeap.add(v);
		}

		void del(int v) {
			delHeap.add(v);
			clean();
		}

		int first() {
			return addHeap.peek();
		}

		int second() {
			int a = popHead();
			int b = first();
			add(a);
			return b;
		}
	}

	public static int MAXN = 100001;
	public static int n, m;