按照题目进行模拟
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 +10;
struct node{
int a, b;
}s[N];
bool cmp(node A, node B) {
if(A.a != B.a) return A.a < B.a;
return A.b < B.b;
}
int main() {
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i++) {
int ret = 0, x = i;
while(x) {
ret += x % 10;
x /= 10;
}
s[i] = {ret, i};
}
sort(s + 1, s + n + 1, cmp);
cout << s[m].b << endl;
return 0;
}