CSP201503-2：数字排序

# include <stdio.h>

# include <stdlib.h>

# include <memory.h>

# include <algorithm>

using namespace std;

struct group {

    int num; //数字

    int times; //出现的次数

};

//比较函数

bool cmp(group a, group b)

{

    if (a.times == b.times)

    {

        return a.num < b.num;

    }

    return a.times > b.times;

}

int main(void)

{

    int n; //数字个数

    scanf("%d", &n);

    group *pInput = (group *)malloc(sizeof(group) * n);

    //初始化输入数组

    for (int i = 0; i < n; i++)

    {

        pInput[i].num = -1;

        pInput[i].times = 0;

    }

    int length = 0;

    for (int i = 0; i < n; i++)

    {

        int tempNum;

        scanf("%d", &tempNum);

        int j = 0;

        int sign = 1;

        while (j < length)

        {

            //如果输入的数字已经存在，直接在time上+1

            if (tempNum == pInput[j].num)

            {

                pInput[j].times += 1;

                sign = 0;

                break;

            }    

            j++;        

        }

        if (sign)

        {

            //如果输入的数字不存在，令num = tmepNum

            pInput[length].num = tempNum;

            pInput[length].times = 1;

            length += 1;

        }

    }

    sort(pInput, pInput + length, cmp);

    for (int i = 0; i < length; i++)

    {

        printf("%d ", pInput[i].num);

        printf("%d\n", pInput[i].times);

    }

    free(pInput);

    return 0;

}