HJ68 成绩排序

题目：


思路：
难点在于排序后相同分数要按输入顺序输出
自己手写一个排序方法，每次找到第一个最小/大的，存起来，再将剩余的继续排序（递归）

提交：

while(line = Number(readline())) {
    let isFromLowToHeight = Number(readline())
    let grades = []
    for (let i = 0; i < line; i++) {
        grades.push(readline().trim().split(' '))
    }
    function getTheOne(arr, isMinOne) {
        if (arr.length === 1) return arr
        let theOne = arr[0]
        let theIndex = 0
        let length = arr.length
        for (let i = 1; i < length; i++) {
            if (isMinOne) {
                if (Number(theOne[1]) > Number(arr[i][1])) {
                    theOne = arr[i]
                    theIndex = i
                }
            } else {
                if (Number(theOne[1]) < Number(arr[i][1])) {
                    theOne = arr[i]
                    theIndex = i
                }
            }
             
        }
        let rest = arr.filter((item, index) => index !== theIndex)
        let result = getTheOne(rest, isMinOne)
        return [theOne, ...result]
    }
    
    let result = getTheOne(grades, isFromLowToHeight)
    result.forEach(item => {
        console.log(item[0] + ' ' + item[1])
    })
}