51Nod 2020 排序相减

题目链接：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=2020

思路：排序 水水

 #include<iostream>
 #include<algorithm>
 #include<string>
 #include<cstring>
 #include<cmath>
 using namespace std;
 int a[];
 bool cmp(int x,int y)
 {
     return x>y;
 }
 int main()
 {
     int t;
     cin>>t;
     int n,k;
     while(t--){
         cin>>n>>k;
         int sum1,sum2;
         while(k--){
             a[]=n/;
             a[]=(n-a[]*)/;
             a[]=(n-a[]*-a[]*)/;
             a[]=n%;
             sort(a,a+);
             sum1=a[]*+a[]*+a[]*+a[];
             sort(a,a+,cmp);
             sum2=a[]*+a[]*+a[]*+a[];
             n=abs(sum1-sum2);
         }
         cout<<n<<endl;
     }
     return ;
 }