11651 좌표 정렬하기 2

---

https://st-lab.tistory.com/search/11651

Stranger's LAB

 

 

---

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
 public static void main(String[] args) throws IOException{
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	int N = Integer.parseInt(br.readLine());
	int[][] arr = new int[N][2];	
	for(int i = 0; i < N; i++) {
		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
		arr[i][0] = Integer.parseInt(st.nextToken()); //x
		arr[i][1] = Integer.parseInt(st.nextToken()); //y
	}
	Arrays.sort(arr, (e1, e2) -> {
		if(e1[1] == e2[1]) { //y좌표가 같으면
			return e1[0]- e2[0]; //x좌표와 비교
		}
		else {
			return e1[1] - e2[1];
		}
	});
	StringBuilder sb = new StringBuilder();
	for(int i = 0; i < N; i++) {
		sb.append(arr[i][0]+" "+arr[i][1]).append('\n');
	}
	System.out.println(sb);
 }
}