너T야? 나 T(story)야….

import java.util.Arrays;import java.util.Comparator;import java.util.Scanner;public class BJ1931 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N=sc.nextInt(); int[][] arr = new int[N][2]; for(int i=0;i() { @Override public int compare(int[] o1, int[] o2) { if (o1[1] == o2[1]) { ..

import java.util.Scanner;public class BJ2630 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); int[] tree = new int[N]; int maxHeight = 0; for(int i = 0; i maxHeight) { maxHeight = tree[i]; } } int result = binarySearch(tree,N,M,maxHeight..

import java.util.Scanner;public class BJ2805 { private static int whiteCount = 0; private static int blueCount = 0; public static void main(String[] args) { Scanner scanner = new Scanner(System.in); // 종이의 크기 N 입력 int N = scanner.nextInt(); int[][] paper = new int[N][N]; // 종이의 색 입력 (0: 하얀색, 1: 파란색) for (int i = 0; i  분할 + 정복