水题,直接代码!
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int s[10009];
int main()
{
int t,j,i,sum;
while(scanf("%d",&t)!=EOF)
{
sum=0;
for(i=0;i<t;i++)
scanf("%d",&s[i]);
sort(s,s+t);
reverse(s,s+t);
for(i=0;i<=t/2;i++)
{
if(t%2==0&&i==t/2)
break;
printf(sum==0?"%d":" %d",s[i]);
reverse(s,s+t);
sum++;
if(i==t/2) break;
printf(sum==0?"%d ":" %d",s[i]);
reverse(s,s+t);
}
printf("\n");
}
return 0;
}
复杂度略高,目前就只能想到这里,还是菜鸟!
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int s[10009];
int main()
{
int t,j,i,sum;
while(scanf("%d",&t)!=EOF)
{
sum=0;
for(i=0;i<t;i++)
scanf("%d",&s[i]);
sort(s,s+t);
reverse(s,s+t);
for(i=0;i<=t/2;i++)
{
if(t%2==0&&i==t/2)
break;
printf(sum==0?"%d":" %d",s[i]);
reverse(s,s+t);
sum++;
if(i==t/2) break;
printf(sum==0?"%d ":" %d",s[i]);
reverse(s,s+t);
}
printf("\n");
}
return 0;
}
复杂度略高,目前就只能想到这里,还是菜鸟!