hdu2673 sort水题，一遍过

最新推荐文章于 2021-07-28 11:45:17 发布

原创最新推荐文章于 2021-07-28 11:45:17 发布 · 524 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm #博客 #hdu2673

简单题同时被 2 个专栏收录

16 篇文章

订阅专栏

ACM——sort

3 篇文章

订阅专栏

本文介绍了一种通过输入序列，先选择最大数，然后选择最小数，以此类推，直到所有数字都被选择的算法。提供了一个C++实现示例，包括输入和输出说明。

shǎ崽 OrOrOrOrz

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7356 Accepted Submission(s): 3505

Problem Description

Acmer in HDU-ACM team are ambitious, especially shǎ崽, he can spend time in Internet bar doing problems overnight. So many girls want to meet and Orz him. But Orz him is not that easy.You must solve this problem first.
The problem is :
Give you a sequence of distinct integers, choose numbers as following : first choose the biggest, then smallest, then second biggest, second smallest etc. Until all the numbers was chosen .
For example, give you 1 2 3 4 5, you should output 5 1 4 2 3

Input

There are multiple test cases, each case begins with one integer N(1 <= N <= 10000), following N distinct integers.

Output

Output a sequence of distinct integers described above.

Sample Input

5
1 2 3 4 5

Sample Output

5 1 4 2 3												




#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int num[10050],i,right,left,n,flag;
	while(scanf("%d",&n)!=EOF)
	{
		flag=0;
		for(i=0;i<n;i++)
		{
			scanf("%d",&num[i]);
		}
		left=0;right=n-1;
		sort(num,num+n);
		while(left<=right)
		{
			if(left==right)
			{
				if(flag) printf(" ");
				printf("%d",num[left]);
				break;
			}
			if(flag) printf(" ");
			printf("%d",num[right--]);
			flag=1;
			if(flag) printf(" ");
			printf("%d",num[left++]);
		}
		printf("\n");
	}
	return 0;
}