数位排序 运用sort自定义排序

解题思路:

注意事项:

参考代码:

#include<iostream>

#include<algorithm>

using namespace std;

bool cmp(int a,int b)

{

int asum=0,bsum=0;

int x=a,y=b;

while(x!=0)

{

asum+=x%10;

x/=10; 

}

while(y!=0)

{

bsum+=y%10;

y/=10; 

}

if(asum<bsum)return 1;

else if(asum>bsum)return 0;

else if(asum==bsum)

{

if(a<b)return 1;

else return 0;

}

}

int main() {

    int number[1000000];

    int n;

    scanf("%d",&n);

    int m;

    scanf("%d",&m);

    for(int i=1;i<=n;i++)number[i]=i;

    sort(number+1,number+n+1,cmp);

    printf("%d",number[m]);

}