【2019校招真题】排队唱歌（python）

解题思路

完整代码

import bisect
n = int(input())
nums = []
for _ in range(n):
  nums.append(int(input()))
result = 0
lst = [nums[0]]
for i in range(1, n):
  idx = bisect.bisect_left(lst, nums[i])
  bisect.insort(lst, nums[i])
  result += i - idx  
print(result)
'''
num = sorted(nums)
i = 0
while i < n:
  idx = num.index(nums[i])
  i += 1
  result += idx
  num = num[0: idx] + num[idx + 1:]
print(result)
'''