Задача про людей и мешки

m, n, a = int(input()), int(input()), []
 
for i in range(n):
  a.append(int(input()))
 
k, s, i = 0, 0, 0
 
while a:
  while i<len(a):
    if (s + a[i]) <= m:
      s += a[i]
      del a[i]
    else:
      i += 1
  else:
    k += 1
    s, i = 0, 0
 
print(k)

m, n, a = int(input()), int(input()), []
 
for i in range(n):
  a.append(int(input()))
 
k, s, i, x = 0, 0, 0, 0
 
while a:
  while i<len(a) and x < 2:
    if (s + a[i]) <= m:
      s += a[i]
      del a[i]
      x += 1
    else:
      i += 1
  else:
    k += 1
    s, i, x = 0, 0, 0
 
print(k)

maxWeight = int(input())
packagesAmount = int(input())
packagesWeightList = []
 
for i in range(packagesAmount):
    packagesWeightList.append(int(input())) 
 
weightOnPeople = 0
packagesCountOnPeople = 0
peopleAmount = 0
sortedWeightList = []
maxSumm = 0
sumIndex = 0   
 
 
 
for i in range(packagesAmount):
    if packagesWeightList[i] != -1:
        sortedWeightList.append(packagesWeightList[i])
        
        for j in range(i + 1, packagesAmount):
            if (packagesWeightList[i] + packagesWeightList[j]) <= maxWeight and (packagesWeightList[i] + packagesWeightList[j]) > maxSumm and packagesWeightList[j] != -1:
                maxSumm = packagesWeightList[j] + packagesWeightList[i]
                sumIndex = j
        if packagesWeightList[i] < maxSumm:
            sortedWeightList.append(packagesWeightList[sumIndex]) 
            packagesWeightList[sumIndex] = -1
            maxSumm = 0
            sumIndex = 0
 
for i in range(packagesAmount):
    if(packagesCountOnPeople == 2) or (weightOnPeople + sortedWeightList[i] > maxWeight):
        packagesCountOnPeople = 0
        weightOnPeople = 0
        peopleAmount += 1
 
    weightOnPeople+= sortedWeightList[i]
    packagesCountOnPeople += 1
 
    if i == packagesAmount - 1 and weightOnPeople <= maxWeight and packagesCountOnPeople <= 2:
        peopleAmount += 1
    
 
print(peopleAmount)

m, n, a = int(input()), int(input()), []
 
for i in range(n):
  a.append(int(input()))
 
k, s, i, x = 0, 0, 0, 0
 
if max(a) <= m:
  while a:
    while i<len(a) and x < 2:
      if (s + a[i]) <= m:
        s += a[i]
        del a[i]
        x += 1
      else:
        i += 1
    else:
      k += 1
      s, i, x = 0, 0, 0
   
  print(k)