hdu 5702 Solving Order

最新推荐文章于 2021-02-02 21:42:12 发布

慧丫儿

最新推荐文章于 2021-02-02 21:42:12 发布

阅读量440

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_42819248/article/details/82633265

本文介绍了一个特殊比赛——CCPC女生赛中的气球吹制问题。通过回忆不同颜色气球的数量来确定解决问题的顺序，从易到难排列。文章提供了具体的输入输出样例和实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

Welcome to HDU to take part in the first CCPC girls’ competition!

As a pretty special competition, many volunteers are preparing for it with high enthusiasm.
One thing they need to do is blowing the balloons.

Before sitting down and starting the competition, you have just passed by the room where the boys are blowing the balloons. And you have found that the number of balloons of different colors are strictly different.

After thinking about the volunteer boys’ sincere facial expressions, you noticed that, the problem with more balloon numbers are sure to be easier to solve.

Now, you have recalled how many balloons are there of each color.
Please output the solving order you need to choose in order to finish the problems from easy to hard.
You should print the colors to represent the problems.

Input

The first line is an integer T which indicates the case number.
And as for each case, the first line is an integer n, which is the number of problems.
Then there are n lines followed, with a string and an integer in each line, in the i-th line, the string means the color of ballon for the i-th problem, and the integer means the ballon numbers.

It is guaranteed that:
T is about 100.
1≤n≤10.
1≤ string length ≤10.
1≤ bolloon numbers ≤83.(there are 83 teams :p)
For any two problems, their corresponding colors are different.
For any two kinds of balloons, their numbers are different.

Output

For each case, you need to output a single line.
There should be n strings in the line representing the solving order you choose.
Please make sure that there is only a blank between every two strings, and there is no extra blank.

Sample Input

3
3
red 1
green 2
yellow 3
1
blue 83
2
red 2
white 1

Sample Output

yellow green red
blue
red white

#include<stdio.h>
#include<string.h>

struct part{
    char color[11];
    int num;
};


int main()
{
    struct part a[100], temp;
    int t, n, i, j;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(i = 0;i < n;i++)
        {
            getchar();
            scanf("%s %d", a[i].color, &a[i].num);
        }

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

                for(j = i+1;j < n;j++)
                {
                    if(a[j].num > a[i].num)
                    {
                        temp = a[j];
                        a[j] = a[i];
                        a[i] = temp;
                    }
                }


        }
        for(i = 0;i < n-1;i++)
                {
                    printf("%s ", a[i].color);
                }
                printf("%s", a[i].color);

            printf("\n");
    }
    return 0;
}