贪心算法（贪婪）python

Problem A

n=input().split()
ans=0
for _ in range(int(n[0])):
    ans+=max(int(x) for x in input().split())
print(ans)

Problem B

n=int(input())
ns=[int(x) for x in input().split()]
avg=sum(ns)//n
ans=0
for x in range(n-1):
    c=avg-ns[x]
    if c:
        ns[x+1]-=c
        ans+=1
print(ans)

Problem  C

n=int(input())
s=[]
for _ in range(n):
    s.append([int(x) for x in input().split()])
s.sort(key=lambda x:x[1])
ans,end=0,0
for x in s:
    if x[0]>=end:
        ans+=1
        end=x[1]
print(ans)

Problem  D

n=list(input())
s=int(input())
for _ in range(s):
    for i in range(len(n)-1):
        if n[i]>n[i+1]:
          &