这个题由于我一开始重载运算符不会写,我就用了pair来偷懒(hh):
pair:
先用first比较大小,再用second进行比较。
一遍sort,AC!
code:
#include <iostream>
#include <cstring>
#include <algorithm>
#define x first
#define y second
using namespace std;
const int N = 1e6+7;
int n,m;
pair<int,int> arr[N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ ){
arr[i].y=i;
int sum=i;
while (sum){
arr[i].x+=sum%10;
sum/=10;
}
}
sort(arr+1,arr+n+1);
printf("%d",arr[m].y);
return 0;
}