对称排序（南阳oj283）

对称排序

时间限制： 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<iostream>
#include<string.h>
#include<string>
#include<algorithm>
using namespace std; 
int cmp(string x,string y)
{
	return x.size()<y.size();
}
int main()
{
	string s[100];
	int vis[100];
	int kase=1;
	int n;
	while(scanf("%d",&n),n)
	{
		memset(vis,0,sizeof(vis));
		for(int i=0;i<n;i++)
		    cin>>s[i];
		sort(s,s+n,cmp);
		printf("SET %d\n",kase++);
		for(int i=0;i<n;i+=2)
		{
			cout<<s[i]<<endl;
            vis[i]=1;
		}
		for(int i=n-1;i>=1;i--)
		{
			if(!vis[i])
			    cout<<s[i]<<endl;
		}
		
	}
}