1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import java.util.*

class Solution {
    fun solution(jobs: Array<IntArray>): Int {
        var answer = 0

        val jobList = ArrayList<IntArray>()
        var ms = Integer.MAX_VALUE
        for (job in jobs) {
            jobList.add(job)
            if (ms > job[0])
                ms = job[0]
        }

        val runningTimeList = ArrayList<Int>()

        while (jobList.isNotEmpty()) {

            var selectedIdx = -1
            var fastestJobTime = Integer.MAX_VALUE
            for (idx in jobList.indices) {
                val p = jobList[idx]
                if (p[0] <= ms && fastestJobTime > p[1]) {
                    selectedIdx = idx
                    fastestJobTime = p[1]
                }
            }

            if (selectedIdx == -1) {
                fastestJobTime = Integer.MAX_VALUE
                for (idx in jobList.indices) {
                    val p = jobList[idx]
                    if (fastestJobTime > p[1]) {
                        selectedIdx = idx
                        fastestJobTime = p[1]
                        ms = p[0]
                    }
                }
            }

            var runningJob = jobList.removeAt(selectedIdx)
            runningTimeList.add((ms - runningJob[0]) + runningJob[1])
            ms += runningJob[1]
        }

        var totalRunningTime = 0
        for (runningTime in runningTimeList) {
            totalRunningTime += runningTime
        }

        answer = totalRunningTime / runningTimeList.size

        return answer
    }
}