Problem B: small challenge

Problem B: Small challenge
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 2544 Solved: 835
Description
Xiaodu's first round victory over human expert Wang Feng , Later, we will challenge human beings in succession . For human dignity , The hall of fame is ranked according to its ability value according to its needs , To meet small challenges .

Input
Multiple sets of test data , Enter an integer for each group T, Represents the number of groups , Enter an integer for each group n （n <= 30), Indicates the number of people in the hall of fame , And then there was n That's ok , Enter the names and Pinyin of the people in the hall of fame on each line ( No more than 10 Letters ) And an integer , This integer represents the ability value of the players in the hall of fame .

Output
For each group of test data , Output one line , According to the ability value from high to low , Export name

Sample Input
1
3
Alice 12
Bob 11
Cate 15
Sample Output
Cate
Alice
Bob

#include <stdio.h>
#include <string>
typedef struct node{
    
	char name[20];
	int val;
}node;
int main() 
{
    
	int T;
	scanf("%d",&T);
	while (T--)
	{
    
		int n;
		scanf("%d",&n);
		int i;
		node p[33];
		for (i = 0;i < n;i++ )
		{
    
			scanf("%s%d",p[i].name,&(p[i].val));
			//printf("%s %d\n",p[i].name,p[i].val);
			//getchar();
		}
		for (i = 0;i < n-1;i++)
		{
    
			for (int j=0;j < n-1-i;j++)
			{
    
				if (p[j].val < p[j+1].val)
				{
    
					node t = p[j];
					p[j] = p[j+1];
					p[j+1] = t;
				}
			}
		}
		for (i = 0;i < n;i++)
		{
    
			printf("%s\n",p[i].name);
		}
		
	}
	return 0;
}

There is a doubt. , That's why it's defined as
char* name;
scanf("%s",p.name); It can't be used
It's defined as
char[20] name;
scanf("%s",p.name);
You can use it ？

We found the reason , Refer to my article
https://blog.csdn.net/xiaojin_hhhc/article/details/122409210