|
| 1 | +package backjoon; |
| 2 | +// https://www.acmicpc.net/problem/11650 |
| 3 | +// 좌표 정렬하기 |
| 4 | +import java.io.BufferedReader; |
| 5 | +import java.io.IOException; |
| 6 | +import java.io.InputStreamReader; |
| 7 | +import java.util.Arrays; |
| 8 | +import java.util.Comparator; |
| 9 | +import java.util.StringTokenizer; |
| 10 | + |
| 11 | +public class _11650 { |
| 12 | + public static void main(String[] args) throws IOException { |
| 13 | + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |
| 14 | + //sol memory runtime |
| 15 | + int N = Integer.parseInt(br.readLine()); |
| 16 | + int[][] arr = new int[N][2]; |
| 17 | + |
| 18 | + StringTokenizer st; |
| 19 | + for(int i = 0; i < N; i++) { |
| 20 | + st = new StringTokenizer(br.readLine()); |
| 21 | + arr[i][0] = Integer.parseInt(st.nextToken()); |
| 22 | + arr[i][1] = Integer.parseInt(st.nextToken()); |
| 23 | + } |
| 24 | + |
| 25 | + Arrays.sort(arr, new Comparator<int[]>() { |
| 26 | + @Override |
| 27 | + public int compare(int[] e1, int[] e2) { |
| 28 | + if(e1[0] == e2[0]) { // 첫번째 원소가 같다면 두 번째 원소끼리 비교 |
| 29 | + return e1[1] - e2[1]; |
| 30 | + } else { |
| 31 | + return e1[0] - e2[0]; |
| 32 | + } |
| 33 | + } |
| 34 | + }); |
| 35 | + |
| 36 | + // 위의 식을 람다로 표현하면 아래 주석과 같음 |
| 37 | +// Arrays.sort(arr, (e1,e2) -> { |
| 38 | +// if(e1[0] == e2[0]){ |
| 39 | +// return e1[1] - e2[1]; |
| 40 | +// }else{ |
| 41 | +// return e1[0] - e2[0]; |
| 42 | +// } |
| 43 | +// }); |
| 44 | + |
| 45 | + StringBuilder sb = new StringBuilder(); |
| 46 | + for(int i = 0 ; i< N ; i++) { |
| 47 | + sb.append(arr[i][0] + " " + arr[i][1]).append('\n'); |
| 48 | + } |
| 49 | + System.out.println(sb); |
| 50 | + |
| 51 | + } |
| 52 | +} |
0 commit comments