51Nod 2020 排序相减

#include<iostream>  #include<queue>  #include<vector>  #include<stack>  #include<algorithm>#include<cmath> #include<set>#include<map>#include<cstdio>using namespace std;int getmax(int *a){int sum=0;for(int i=3;i>=0;i--){sum=sum*10+a[i];}return sum;}int getmin(int *a){int sum=0;for(int i=0;i<4;i++){sum=sum*10+a[i];}return sum;}int main(){int n;cin>>n;while(n--){int a,b;scanf("%d %d",&a,&b);while(b--){int num[10],cnt=0;while(a){num[cnt++]=a%10;a/=10;}sort(num,num+4);int maxn=getmax(num);int minn=getmin(num);a=maxn-minn;}printf("%d\n",a);}return 0;}