def solution(jobs): answer = 0 def takeSecond(elem): return elem[1] jobs.sort(key=takeSecond) prev = 0 for j in jobs: #print(j, answer) answer += (j[1]+prev) prev += j[1] #print(answer) return (answer-1)//len(jobs)