FAQ | About Virtual Judge | Forum | Discuss | Open Source Project
All Copyright Reserved ©2010-2014 HUST ACM/ICPC TEAM
Anything about the OJ, please ask in the forum, or contact author: Isun, but NEVER contact freefcw@gmail.com, who is irrelevant to this site !!
Server Time:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
long long a[1111],b,c,d[1111],n,i,j,min,h,l,k,t,s,ant,cnt;
while(scanf("%lld",&n)!=EOF)
{ //原数组中必定有0,和一个负数 就按是否有正整数进行讨论
for(i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
sort(a+1,a+n+1);
if(a[n]>0)
{
printf("%d %lld\n",1,a[1]); //如果写成lld 整型向长整形转换 低向高提交错误
printf("%d %lld\n",1,a[n]);
printf("%d ",n-1-2+1);
for(i=2;i<=n-1;i++)
{
if(i>2)
printf(" ");
printf("%lld",a[i]);
}
}
else
{
printf("%d %lld\n",1,a[1]);
printf("%d %lld %lld\n",2,a[2],a[3]);
printf("%d ",n-4+1);
for(i=4;i<=n;i++)
{
if(i>4)
printf(" ");
printf("%lld",a[i]);
}
}
printf("\n");
}
return 0;
}