关闭

NYOJ-283-对称排序-2013年11月5日22:11:16

699人阅读 评论(0) 收藏 举报
分类:

对称排序

时间限制:1000 ms  |  内存限制:65535 KB
难度:1
描述
In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that each name is at least as long as the one preceding it). However, your boss does not like the way the output looks, and instead wants the output to appear more symmetric, with the shorter strings at the top and bottom and the longer strings in the middle. His rule is that each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. In the first example set below, Bo and Pat are the first pair, Jean and Kevin the second pair, etc. 
输入
The input consists of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, n, which is the number of strings in the set, followed by n strings, one per line, NOT SORTED. None of the strings contain spaces. There is at least one and no more than 15 strings per set. Each string is at most 25 characters long. 
输出
For each input set print "SET n" on a line, where n starts at 1, followed by the output set as shown in the sample output.
If length of two strings is equal,arrange them as the original order.(HINT: StableSort recommanded)
样例输入
7
Bo
Pat
Jean
Kevin
Claude
William
Marybeth
6
Jim
Ben
Zoe
Joey
Frederick
Annabelle
5
John
Bill
Fran
Stan
Cece
0
样例输出
SET 1
Bo
Jean
Claude
Marybeth
William
Kevin
Pat
SET 2
Jim
Zoe
Frederick
Annabelle
Joey
Ben
SET 3
John
Fran
Cece
Stan
Bill

 
# include<stdio.h>
# include<string.h>
# include<stdlib.h>
# include<algorithm>
using namespace std;

typedef struct
{
	char s[20];
	int len;
}str;

bool cmp(str a,str b)
{
	return a.len < b.len;
}

int main()
{
	int n,i,j,k;
	str a[30];
	k = 0;
	while(scanf("%d",&n) && n!=0)
	{
		getchar();
		k++;
		for(i=0;i<n;i++)
		{	
			scanf("%s",a[i].s);
			a[i].len = strlen(a[i].s);
		}

		sort(a,a+n,cmp);	
		
		printf("SET %d\n",k);		
		
		for(i=0;i<n;i+=2)	
		{
			printf("%s\n",a[i].s);
		}
		if(n%2!=0)
			n = n-1;
		for(i=n-1;i>=1;i-=2)
		{
			printf("%s\n",a[i].s);
		}
		
	}

	return 0;
}        


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    关于我

    我是一个爱编程、爱跑步、爱健身、爱练字的文艺逗比小青年


    此博客是个人在学习算法路程上的一些总结和题解


    现在已开始从事iOS开发,喜欢者请关注我的另一个简书博客

    iOS博客地址(点击进入)



    个人资料
    • 访问:390923次
    • 积分:9788
    • 等级:
    • 排名:第1774名
    • 原创:613篇
    • 转载:5篇
    • 译文:0篇
    • 评论:22条
    博客专栏