shǎ崽 OrOrOrOrz

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

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女生专场公开赛——谁说女子不如男

Recommend

lcy

解题代码

#include<stdio.h>

#include<stdlib.h>

int comp(const void *a,const void *b) {

return *(int *)a-*(int *)b;

}

int main() {

int a[10000];

int i,n;

while(scanf("%d",&i)!=EOF) {

for(n=0;n<i;n++)

scanf("%d",&a[n]);

qsort(a,i,sizeof(int),comp);

for(n=0;n<i/2;n++)

printf(n==i/2-1&&i%2==0?"%d %d\n":"%d %d ",a[i-n-1],a[n]);

if(i%2!=0) printf("%d\n",a[i/2]);

}

return 0;

}

解题思路：

先用快排排序，然后倒正相反同时输出，本体最主要小难点在在偶数和奇数控制输出上，即控制空格输出，然后换行，祝你好运

转载于:https://blog.51cto.com/windorman/876927

2673（2673）shǎ崽 OrOrOrOrz相关推荐

HDU 2673：shǎ崽 OrOrOrOrz
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=2673 Time Limit: 2000/1000 MS (Java/Others) Memory ...
HDOJ 2673 shǎ崽 OrOrOrOrz
shǎ崽 OrOrOrOrz 此题是用来膜拜的 #include <iostream> #include <cstring> #include <algorithm> ...
HDU2673 shǎ崽 OrOrOrOrz【排序】
shǎ崽 OrOrOrOrz Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tota ...
shǎ崽 OrOrOrOrz
sha崽题意:依次输出最大最小次大次小. 思路:模拟一开始scanf忘了加~,输出超限了一发 #include<bits/stdc++.h> using namespace std; ...
POJ 3667 hotel（shǎ崽大神的模板|区间合并）
继续线段树,这题其实是之前一次练习赛的题目,当时最后两小时苦憋这题.无奈一直TLE,只记得后来婷队讲解时还是一知半解,过了久了就忘记这题了.现在重新翻出来看看,是一道区间合并的题目. 英文一大堆,其实 ...
【转载】如果你是ACMer,你会选择哪个职业?（来自shǎ崽）
http://www.notonlysuccess.com/?p=1081 下午受ACM-DIY群里的大神们的启发YY了一套ACMer的技能. 以下十个职业参照WoW.如果你是ACMer,你会选择哪个 ...
杭电OJ分类题目（1）
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(1) HDU Introduction HDU ...
ACM模块解析之数论
数论一.简介数论是ACM中的重点内容.历年竞赛题目,一般都有1~2道题目与数论有密切关系.数论涉及的概念和算法很多,用途也非常广泛.掌握与数论有关的方法,是参赛者需要具备的必要技能.数论的学习 ...
TYUT-A2专题题解
TYUT-A2专题题解循序渐进,基础练起. 01递推与组合 HDU1210 Eddy's 洗牌问题[递推函数+模拟] - 海岛Blog - CSDN博客 HDU2044 一只小蜜蜂...[递推] - ...

2673（2673）shǎ崽 OrOrOrOrz

shǎ崽 OrOrOrOrz

2673（2673）shǎ崽 OrOrOrOrz相关推荐

最新文章

热门文章