Commit 4595571

committed

issue sowon-dev#40 11651 자바

1 parent d9c02fb commit 4595571Copy full SHA for 4595571

File tree

+43

-0

lines changed

+43

-0

lines changed

Lines changed: 43 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,43 @@`
	`1`	`+package backjoon;`
	`2`	`+// https://www.acmicpc.net/problem/11651`
	`3`	`+// 좌표 정렬하기 2`
	`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 _11651 {`
	`12`	`+`
	`13`	`+ public static void main(String[] args) throws IOException {`
	`14`	`+ BufferedReader br = new BufferedReader(new InputStreamReader(System.in));`
	`15`	`+ int N = Integer.parseInt(br.readLine());`
	`16`	`+ //memory 73392 runtime 764`
	`17`	`+ int[][] arr = new int[N][2];`
	`18`	`+`
	`19`	`+ StringTokenizer st;`
	`20`	`+ for(int i = 0; i < N; i++) {`
	`21`	`+ // 위치 주의`
	`22`	`+ st = new StringTokenizer(br.readLine());`
	`23`	`+ arr[i][1] = Integer.parseInt(st.nextToken());`
	`24`	`+ arr[i][0] = Integer.parseInt(st.nextToken());`
	`25`	`+ }`
	`26`	`+`
	`27`	`+ Arrays.sort(arr, (e1, 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`	`+ StringBuilder sb = new StringBuilder();`
	`36`	`+ for(int i = 0 ; i< N ; i++) {`
	`37`	`+ // 위치 주의`
	`38`	`+ sb.append(arr[i][1] + " " + arr[i][0]).append('\n');`
	`39`	`+ }`
	`40`	`+ System.out.println(sb);`
	`41`	`+ }`
	`42`	`+`
	`43`	`+}`

Comments

(0)