10814번 '나이순 정렬'

import java.io.*;

import java.util.*;

class Data {

int id;

int age;

String name;

public Data(int id, int age, String name) {

this.id = id;

this.age = age;

this.name = name;

}

}

class Main {

public static void main(String[] args) throws IOException {

BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

int count = Integer.parseInt(in.readLine());

ArrayList<Data> arrayList = new ArrayList<>();

for(int i=0; i<count; ++i) {

String[] input = in.readLine().split(" ");

int age = Integer.parseInt(input[0]);

String name = input[1];

arrayList.add(new Data(i, age, name));

}

Collections.sort(arrayList, new Comparator<Data>() {

@Override

public int compare(Data first, Data second) {

if(first.age == second.age) {

if(first.id > second.id) {

return 1;

} else {

return -1;

}

} else if(first.age > second.age) {

return 1;

} else {

return -1;

}

}

});

for(int i=0; i<count; ++i) {

System.out.print(arrayList.get(i).age + " ");

System.out.print(arrayList.get(i).name);

System.out.println();

}

}

}

정렬 기준 작성하는게 잘 이해가 안간다... 

처음 생각한 것과 정반대로 했더니 맞았다.

let count = Int(readLine()!)!

var array = [(id: Int, age: Int, name: String)]()

for i in 0..<count {

    let input = readLine()!.split(separator: " ")

    array.append((i, Int(input[0])!, input[1].description))

}

array.sort { (first, second) -> Bool in

    if first.age == second.age {

        return first.id < second.id

    }

    return first.age < second.age

}

for i in array {

    print(i.age, i.name)

}

역시나 Swift론 간단하게 구현 가능했다.