结构体排序
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
struct number{
int val;
int sum=0;
}num[1000005];
bool cmp(number x, number y)
{
if(x.sum!=y.sum)
return x.sum<y.sum;
else
return x.val<y.val;
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
{
num[i].val=i+1;
int t=i+1;
while(t)
{
num[i].sum+=t%10;
t/=10;
}
}
sort(num,num+n,cmp);
cout<<num[m-1].val<<endl;
}