n,m=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
cnt,ans=0,0
for i in l:
if m-i>=0:
m=m-i
cnt+=1
ans+=i
print(cnt,ans)
n,m=map(int,input().split())
S=list(map(int,input().split()))
T=list(map(int,input().split()))
S.sort()
T.sort()
s,t=0,0
ans=0
while True:
if s>=n or t>=m:
break
if S[s]<=T[t]:
s+=1
t+=1
ans+=1
else:
t+=1
print(ans)
l=list(map(int,input().split()))
ans=''
for i in range(9,-1,-1):
if l[i]!=0 or i==0:
ans+=str(i)*l[i]
print(int(ans))
n=int(input())
l=[]
for i in range(n):
a,b=map(int,input().split())
l.append([a,b])
l.sort(reverse=True)#先按左端点从小到大排序
print(l)
l.sort(key= lambda x:x[1])#再按右端点从小到大排序
#保证区间宽度最小,且较靠左边的区间在前面
#print(l)
a,b=l[0][0],l[0][1]
ans=1
for i in range(1,n):
if l[i][0]>=b:
ans+=1
b=l[i][1]
print(ans)
n=int(input())
l=[]
for i in range(n):
a,b=map(int,input().split())
l.append([a,b])
l.sort()
l.sort(key= lambda x:x[1])
#print(l)
a,b=l[0][0],l[0][1]
ans=1
for i in range(1,n):
if l[i][0]>b:#改为大于即可
ans+=1
b=l[i][1]
print(ans)
注意,直接用sort排序会出错
n=int(input())
l=input().split()
def bubble_sort(nums):
for i in range(n-1):
for j in range(n-i-1):
if int(nums[j]+nums[j+1]) > int(nums[j+1]+nums[j]):
nums[j], nums[j+1] = nums[j+1], nums[j]
return nums
s=''.join(bubble_sort(l))
print(int(s))