Submission #5998253

---

Source Code Expand

import std.stdio;
import std.algorithm;
import std.math;
import std.conv;
import std.string;
 
T readNum(T)(){
  return readStr.to!T;
}
 
T[] readNums(T)(){
  return readStr.split.to!(T[]);
}
 
string readStr(){
  return readln.chomp;
}
 
void main(){
  int n = readNum!int;
  auto a = new int[](1000001);
  
  foreach(i; 0 .. n){
    auto j = readNums!int;
    a[j[0]] += 1;
    if(j[0] != 1000000) a[j[1]+1] -= 1;
  }
  
  int like, ret;
  foreach(e; a){
    like += e;
    ret = max(ret, like);
  }
  
  writeln(ret);
}

Submission Info

Judge Result