HDU 2673 shǎ崽 OrOrOrOrz (排序)

#include <stdio.h>  
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

int main()  
{  
    int i=0,t,k=0,j=0,m=0,n=0,a,b,A,B,x,y,sum,flag,M,N,G;
	int count,max=0,ans;
	char v[1005],p[1005];
	int num[10005];
    while(~scanf("%d",&N)) 
	{	   
        for(i=0;i<N;i++)
		{
			scanf("%d",&num[i]);
		}
		sort(num,num+N);
        for(i=0,flag=1;i<N/2.0;i++)   //此处的N/2.0 要注意
		{
			if(N-1-i != i)             //注意中间的那个元素的判断，要不然会重复输出
			{
				printf(flag==1?"%d %d":" %d %d",num[N-1-i],num[i]);
			    flag=0;
			}
			else
               printf(" %d",num[i]);
		}
		printf("\n");
    }  
    return 0;  
}

。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。

分析：水题。主要还是小细节。快排

shǎ崽 OrOrOrOrz

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

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
  
  

 

Author

WhereIsHeroFrom

 

Source

HDU女生专场公开赛——谁说女子不如男