#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int n, m; struct node { int v, cnt = 0; } a[N]; bool cmp(node a, node b) { if (a.cnt != b.cnt) return a.cnt < b.cnt; else return a.v < b.v; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { a[i].v = i; int j = i; while (j != 0) { a[i].cnt += (j % 10); j /= 10; } } sort(a, a + 1 + n, cmp); // for (int i = 1; i <= n; i++) // cout << a[i].v << " "; cout<<a[m].v<<endl; }
解题思路:
注意事项:
参考代码:
0.0分
1 人评分