Submission #923380

---

Source Code Expand

import java.util.Arrays;
import java.util.Scanner;

public class Main {
  Scanner sc = new Scanner(System.in);

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

  class Box {
    int h, w;
  }

  void run() {
    int n = ni();
    Box[] list = new Box[n];
    for (int i = 0; i < n; ++i) {
      int w = ni();
      int h = ni();
      Box b = new Box();
      b.w = w;
      b.h = h;
      list[i] = b;
    }
    Arrays.sort(list, (a, b) -> {
      if (Math.min(b.w, b.h) == Math.min(a.w, a.h)) {
        return Math.max(b.w, b.h) - Math.max(a.w, a.h);
      }
      return Math.min(b.w, b.h) - Math.min(a.w, a.h);
    });
    Box min = new Box();
    min.w = 1 << 28;
    min.h = 1 << 28;
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
      if (min.w > list[i].w && min.h > list[i].h) {
        min = list[i];
        debug(min.w, min.h);
        ++cnt;
      }
    }
    System.out.println(cnt);
  }

  int ni() {
    return Integer.parseInt(sc.next());
  }

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

Submission Info

Judge Result