Skip to content

Instantly share code, notes, and snippets.

@mingyu-lee
Last active July 29, 2018 04:29
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save mingyu-lee/26b32f1800b69ba0cfa24fa0007f7842 to your computer and use it in GitHub Desktop.
Save mingyu-lee/26b32f1800b69ba0cfa24fa0007f7842 to your computer and use it in GitHub Desktop.
BOJ_10814_OrderAge
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class OrderAge {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int numberOfMember = Integer.parseInt(br.readLine());
String[][] inputs = new String[numberOfMember][3];
for (int i = 0; i < numberOfMember; i++) {
String[] temp = br.readLine().split(" ");
inputs[i][0] = temp[0];
inputs[i][1] = temp[1];
inputs[i][2] = String.valueOf(i);
}
Arrays.sort(inputs, (x, y) -> {
if (x[0].equals(y[0])) {
return Integer.compare(Integer.parseInt(x[2]), Integer.parseInt(y[2]));
}
return Integer.compare(Integer.parseInt(x[0]), Integer.parseInt(y[0]));
});
for (int i = 0; i < numberOfMember; i++) {
System.out.println(inputs[i][0] + " " + inputs[i][1]);
}
}
}
@mingyu-lee
Copy link
Author

문제 풀이 소감 :
이전 문제들을 풀면서 Arrays.sort와 배열을 활용하여 이 정도 수준의 정렬 문제는 익숙해진 것 같다.

체감 난이도 :
쉬움

어려웠던 점 :
없음

앞으로 필요할 것 같은 공부 :

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment