2019年西电计试-2数字排序

Problem 2

输入分两部分，首先输入数字个数n，然后输入n个大小为0到1000的数字。输出时依照这些数字各位相加和降序排列，如果数字各位相加和相等时，按照这n个数字大小升序排列

输入：
5
101 100 999 1234 110
输出：
999 27
1234 10
101 2
110 2
100 1
———————————————————————————————————————————

最开始想到的方法，在输出的时候不对应，只能做到把每位数字加和排序，但是排完发现和原数字不匹配。

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

bool compare(int a, int b)
{
    
    
    return a > b;
}
int main()
{
    
    
    int n, a[10001], y[10001];
    int x, b, c, d, e;
    cin>>n;
    for(int i = 0; i < n; i++)
    {
    
    
        cin>>a[i];
        x = a[i] / 10000;
        b = a[i] / 1000 % 10;
        c = a[i] / 100 % 10;
        d = a[i] / 10 % 10;
        e = a[i] % 10;
        y[i] = x + b + c + d + e;
        //cout<<x<<"-"<<b<<"-"<<c<<"-"<<d<<"-"<<e<<endl;
    }
    sort(y, y + n, compare);
    for(int i = 0; i < n; i++)
        cout<<a[i]<<" "<<y[i]<<endl;
    return 0;
}

改进型：

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
/* 
bool compare(int a, int b)
{
    return a > b;
}
*/
int main()
{
    
    
    int n, a[10001], y[10001];
    int x, b, c, d, e, v, m;
    cin>>n;
    for(int i = 0; i < n; i++)
    {
    
    
        cin>>a[i];
        x = a[i] / 10000;
        b = a[i] / 1000 % 10;
        c = a[i] / 100 % 10;
        d = a[i] / 10 % 10;
        e = a[i] % 10;
        y[i] = x + b + c + d + e;
        //cout<<x<<"-"<<b<<"-"<<c<<"-"<<d<<"-"<<e<<endl;
    }
    for(int i = 0; i < n; i++)
    {
    
    
    	for(int j = 0; j < n; j++)
    	{
    
    
    		if((y[i] > y[j]) || (y[i] == y[j] && a[i] < a[j]))
    		{
    
    
    			v = a[i];
    			a[i] = a[j];
    			a[j] = v;
    			m = y[i];
    			y[i] = y[j];
    			y[j] = m;
			}
		}
	}
	for(int i = 0; i < n; i++)
	cout<<a[i]<<" "<<y[i]<<endl;
	return 0;
}

又发现中间的地方似乎可以简化一些，那样写有点麻烦。

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int shu(int a)
{
    
    
    int sum = 0;
    while(a != 0)
    {
    
    
        sum = sum + a % 10;
        a = a / 10;
    }
    return sum;
}

int main()
{
    
    
    int n, a[10001], y[10001];
    int x, b, c, d, e, v, m;
    cin>>n;
    for(int i = 0; i < n; i++)
    {
    
    
        cin>>a[i];
        y[i] = shu(a[i]);
    }
    for(int i = 0; i < n; i++)
    {
    
    
        for(int j = 0; j < n; j++)
        {
    
    
            if((y[i] > y[j]) || (y[i] == y[j] && a[i] < a[j]))
            {
    
    
                v = a[i];
                a[i] = a[j];
                a[j] = v;
                m = y[i];
                y[i] = y[j];
                y[j] = m;
            }
        }
    }
    for(int i = 0; i < n; i++)
        cout<<a[i]<<" "<<y[i]<<endl;
    return 0;
}