Java 알고리즘
import java.util.*;
import java.io.*;
public class Main
{
private static int N, W;
private static ArrayList<int[]> list = new ArrayList<>();
public static void print(){
}
public static void main(String args[]) throws Exception
{
Scanner sc = new Scanner(System.in);
W = sc.nextInt();
N = sc.nextInt();
for(int i=0; i<N; i++){
int[] newInt = new int[] {sc.nextInt(), sc.nextInt()}; //이거 정확히 사용하는 방법
list.add(newInt);
}
for(int i=0; i<list.size(); i++){
System.out.println(list.get(i)[1]);
}
//이 부분들 좀 확실히 확장성을 생각해보자.
Collections.sort(list, Comparator.comparing());
}
}