python来解一下

解题思路:

while True:
	try:
		s=list(map(int,input().split()))
		n,m,items=s[0],s[1],s[2:]
		a=[i for i in items[::2]]
		b=[i for i in items[1::2]]
		times=0
		windom=[0]*n
		for i in range(m):
		    dl,fw=a[i],b[i]
		    min_windom=min(windom)
		    chose=windom.index(min_windom)
		    if windom[chose]>dl:
		        times+=windom[chose]-dl
		    windom[chose]=max(dl,windom[chose])+fw
		ans=times/m
		print(f"{ans:.2f}")
	except:
		break