2018_1_22_poj_2013_重新排序
2018-01-22 20:02
363 查看
Symmetric Order
Description
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.
Input
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, sorted in nondescending order by length. 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.
Output
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.
Sample Input
Sample Output
Source
Mid-Central USA 2004
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 14443 | Accepted: 8568 |
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.
Input
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, sorted in nondescending order by length. 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.
Output
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.
Sample Input
7 Bo Pat Jean Kevin Claude William Marybeth 6 Jim Ben Zoe Joey Frederick Annabelle 5 John Bill Fran Stan Cece 0
Sample Output
SET 1 Bo Jean Claude Marybeth William Kevin Pat SET 2 Jim Zoe Frederick Annabelle Joey Ben SET 3 John Fran Cece Stan Bill
Source
Mid-Central USA 2004
#include<iostream> #include<string> #include<vector> #include<algorithm> using namespace std; struct AA{ string s; int i; }; bool cmp(AA a,AA b){ return a.i<b.i; } using namespace std; int main(){ int n,z=1; while(scanf("%d",&n)!=EOF){ if(n==0)return 0; vector<AA> v; printf("SET %d\n",z++); for(int i=0;i<n;i++){ AA t; cin>>t.s; if(i%2==0)t.i=i/2; else t.i=n-i/2; v.push_back(t); } sort(v.begin(),v.end(),cmp); for(int i=0;i<v.size();i++) cout<<v[i].s<<endl; } return 0; }
相关文章推荐
- poj 1654--重新排序求交换的次数
- POJ 2007 极角排序
- POJ 2388 Who's in the Middle 排序
- poj 2018 Best Cow Fences USACO历年月赛 (分数规划+DP)
- POJ-2018 Best Cow Fences(二分加DP)
- Amazon Campus(2013-Sep-22)Question 1 / 2 (Amazon Campus(5): completely inside interval)
- ALTER语句重命名,重新定义和重新排序列
- POJ 2388快速排序
- poj 2503 Babelfish(字典树或map或哈希或排序二分)
- VS2013显示卡顿,需要最小化后重新打开解决方案等视图才能刷新
- (使用STL自带的排序函数7.3.4)POJ 2371 Questions and answers(sort()函数的使用)
- Japan - POJ 3067 排序+树状数组
- 利用随机函数获取20个1-100的整数并打印,然后进行排序后重新打印。
- POJ 题目1007 DNA Sorting (水题 排序)
- POJ 3321 树状数组(+dfs+重新建树)
- Mysql对自增主键ID进行重新排序
- POJ - 1723 Soldiers 士兵站队 排序+中位数
- 前端对后台传过来是数组进行重新排序显示
- POJ1723 SOLDIERS【中位数+排序】
- 易宝典文章——怎样重新连接并恢复 Exchange Server 2013已删除的用户邮箱