倒置排序=结构体实现C++

最新推荐文章于 2023-12-27 13:39:24 发布

老干妈拌蛋挞

最新推荐文章于 2023-12-27 13:39:24 发布

阅读量352

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/m0_73589137/article/details/129799049

版权

#include <iostream>
#include <algorithm>
using namespace std;
struct index
{
    int before;
    int after;
};
int Reserve(int n)
{
    int s = 0;
    while(n != 0)
    {
        s += (n % 10);
        n /= 10;
        if(n != 0)
        {
            s *= 10;
        }
    }
    return s;
}
bool compare(index a , index b)
{
    return a.after < b.after;
}
int main()
{
    index a[80] ;
    int count = 1 , x;
    cin>>x;
    while(count <= x)
    {
        int n;
        cin>>n;
        for(int i = 0 ;i < n ; i++)
        {
            cin>>a[i].before;
        }
        for(int i = 0 ;i < n ; i++)
        {
            a[i].after = Reserve(a[i].before);
        }
        sort(a , a + n , compare);
        for(int i = 0 ; i < n ; i++)
        {
            cout<<a[i].before<<" ";
        }
        cout<<endl;
        count++;
    }
    return 0;
}