简单python走起 23行 简单 快速

解题思路:

注意事项:

参考代码:

n=int(input())

mas=list(map(int,input().split()))

mas.sort(reverse=true)

mas_1=[[]for i in range(5)]

for i in mas:

    if 90<=i<=100:

        mas_1[0].append(i)

    elif 80<=i<=89:

        mas_1[1].append(i)

    elif 70<=i<=79:

        mas_1[2].append(i)

    elif 60<=i<=69:

        mas_1[3].append(i)

    elif 0<=i<=59:

        mas_1[4].append(i)

print(len(mas_1[0]),len(mas_1[1]),len(mas_1[2]),len(mas_1[3]),len(mas_1[4]))

x=max(len(mas_1[0]),len(mas_1[1]),len(mas_1[2]),len(mas_1[3]),len(mas_1[4]))

print(x)

l=[len(mas_1[0]),len(mas_1[1]),len(mas_1[2]),len(mas_1[3]),len(mas_1[4])]

z=l.index(x)

mas_1[z].sort(reverse=true)

h=[str(j)for j in mas_1[z] ]

print(' '.join(h))