Submission #229778

---

Source Code Expand

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.lang.Math.*;

public class Main {

	int INF = 1 << 28;
	//long INF = 1L << 62;
	double EPS = 1e-10;
	int MAX = 1000000;

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] imos = new int[MAX+2];
		for (int i=0;i<n;i++) {
			int a = sc.nextInt(), b = sc.nextInt();
			imos[a] += 1; imos[b+1] -= 1; 
		}
		int max = imos[0];
		for (int i=1;i<MAX+2;i++) {
			imos[i] += imos[i-1];
			max = max(imos[i], max);
		}
//		debug(imos, max);
		System.out.println(max);
	}

	void debug(Object... os) {
		System.err.println(Arrays.deepToString(os));
	}

	public static void main(String[] args) {
		new Main().run();
	}
}

Submission Info

Judge Result