Sinking Ship

The ship crashed into a reef and is sinking. Now the entire crew must be evacuated. All n crew members have already lined up in a row (for convenience let’s label them all from left to right with positive integers from 1 to n) and await further instructions. However, one should evacuate the crew properly, in a strict order. Specifically:

The first crew members to leave the ship are rats. Then women and children (both groups have the same priority) leave the ship. After that all men are evacuated from the ship. The captain leaves the sinking ship last.

If we cannot determine exactly who should leave the ship first for any two members of the crew by the rules from the previous paragraph, then the one who stands to the left in the line leaves the ship first (or in other words, the one whose number in the line is less).

For each crew member we know his status as a crew member, and also his name. All crew members have different names. Determine the order in which to evacuate the crew.

Input
The first line contains an integer n, which is the number of people in the crew (1 ≤ n ≤ 100). Then follow n lines. The i-th of those lines contains two words — the name of the crew member who is i-th in line, and his status on the ship. The words are separated by exactly one space. There are no other spaces in the line. The names consist of Latin letters, the first letter is uppercase, the rest are lowercase. The length of any name is from 1 to 10 characters. The status can have the following values: rat for a rat, woman for a woman, child for a child, man for a man, captain for the captain. The crew contains exactly one captain.

Output
Print n lines. The i-th of them should contain the name of the crew member who must be the i-th one to leave the ship.

Examples
Input
6
Jack captain
Alice woman
Charlie man
Teddy rat
Bob child
Julia woman
Output
Teddy
Alice
Bob
Julia
Charlie
Jack
该题的意思是将一队人分成老鼠、(妇女、儿童)优先顺序相同、男人、船长,写四个for循环感觉就出来了。
#include"stdio.h"
#include"string.h"
#include"cstring"
int main()
{
int n;
char a[105][11],b[105][11];
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
scanf("%s %s",a[i],b[i]);
}
for(int i=0;i<n;i++)
{
if(b[i][0]‘r’)
printf("%s\n",a[i]);
}
for(int i=0;i<n;i++)
{
if(b[i][0]
‘w’||b[i][0]‘c’&&b[i][1]‘h’)
{
printf("%s\n",a[i]);

				}     	
			}
			for(int i=0;i<n;i++)
			{
			    if(b[i][0]=='m')
		    	   printf("%s\n",a[i]);
			}
			for(int i=0;i<n;i++)
			{
				if(b[i][0]=='c'&&b[i][1]=='a')
		    	   printf("%s\n",a[i]);
			}    
		} 
		return 0;
	}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值