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

## 对称排序

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-对称排序

• jtahstu
• 2014年12月16日 02:18
• 5398

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

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

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

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

## 面试经历---广州多益网络（2015年11月5日下午）

• brushli
• 2015年11月05日 22:55
• 4689

举报原因： 您举报文章：NYOJ-283-对称排序-2013年11月5日22:11:16 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)