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

原创 2013年12月02日 20:42:38

对称排序

时间限制: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;
}        


版权声明:本文为博主原创文章,如若转载请注明出处和链接。

相关文章推荐

nyoj,283,对称排序

对称排序 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 In your job at Albatross Circus Management (y...

NYOJ 283 对称排序

对称排序 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 In your job at Albatross Circus Management...

nyoj-283-对称排序

对称排序 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 In your job at Albatross Circus Management (yes...
  • jtahstu
  • jtahstu
  • 2014年12月16日 02:18
  • 5398

283 对称排序

对称排序 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 In your job at Albatross Circus Management...

关于SQLite3 编译及交叉编译的一些问题 (2012-12-11 16:22:18)

from : http://blog.sina.com.cn/s/blog_5f2e119b0101ibwn.html SQLite3 (http://www.sqlite.org)是一个非...

20世纪最好的十大算法、算法笔记(2008-11-15 22:16:57、2011-04-21 19:29:05)

Algorithm(算法)一词与9世纪的阿拉伯学者al-Khwarizmi有关,他写的书《al-jabr w’al muqabalah》(代数学)演变成为现在中学的代数教科书。Ad-Khwarizmi...

找规律 (1) 1, 2, 4, 7, 8, 11, 14, 16, 17, 19, 22, 26, 28, 29, 41, 44, ?

程序说明  操作系统:win7 64位专业版  集成环境:vs2010  以下代码经过测试好用...

nyoj 对称排序

对称排序 描述 In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have j...

创投日报:11月3日至5日收录投融资项目13起

11月03日,钛博士机器人侦测到 10 起发生在科技和互联网行业的投融资或并购事件,其中 5 起发生在中国境内,5 起发生在海外,总计交易额超过55.8亿人民币。 中国境内今天科技行业投...
  • age12v
  • age12v
  • 2017年11月06日 00:00
  • 19

面试经历---广州多益网络(2015年11月5日下午)

广州多益网络是一家做网络游戏的公司,公司地址竟然在萝岗那边,好远哦,而且交通不太方便,哥从天河这边过去,足足转了三趟公交,花了两个半小时才到那个鬼地方。 HR先给我一份笔试题,总共八道题,哥现在只记...
  • brushli
  • brushli
  • 2015年11月05日 22:55
  • 4689
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:NYOJ-283-对称排序-2013年11月5日22:11:16
举报原因:
原因补充:

(最多只允许输入30个字)