CSP分蛋糕、学生排队

#分蛋糕100
n,k=map(int,input().split())
a=list(map(int,input().split()))
count=0
s = 0
for i in range(n):
    s += a[i]
    if s<k:
        if i == n - 1:#分到最后一块蛋糕
            count += 1
        continue
    else:
        s=0
    count+=1
print(count)

#学生排队100
n=int(input())
m=int(input())
a=[]#存储信息
b=[]#存储原有序数字
for i in range(n+1):
    b.append(i)
for i in range(m):
    a.append(list(map(int,input().split())))
for i in range(m):
    temp=b.index(a[i][0])#保留原索引位置
    b.pop(b.index(a[i][0]))
    b.insert(temp+a[i][1],a[i][0])
print(b[1],end='')
for i in range(2,n+1):
    print('',b[i],end='')