【CodeForces - 300A】Array

点击打开链接 和  点击打开链接

                                        Array

 

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vitaly has an array of n distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold:

1. The product of all numbers in the first set is less than zero ( < 0).
2. The product of all numbers in the second set is greater than zero ( > 0).
3. The product of all numbers in the third set is equal to zero.
4. Each number from the initial array must occur in exactly one set.

Help Vitaly. Divide the given array.

Input

The first line of the input contains integer n (3 ≤ n ≤ 100). The second line contains n space-separated distinct integers a1, a2, ..., an(|ai| ≤ 103) — the array elements.

Output

In the first line print integer n1 (n1 > 0) — the number of elements in the first set. Then print n1 numbers — the elements that got to the first set.

In the next line print integer n2 (n2 > 0) — the number of elements in the second set. Then print n2 numbers — the elements that got to the second set.

In the next line print integer n3 (n3 > 0) — the number of elements in the third set. Then print n3 numbers — the elements that got to the third set.

The printed sets must meet the described conditions. It is guaranteed that the solution exists. If there are several solutions, you are allowed to print any of them.

Examples

input

3
-1 2 0

output

1 -1
1 2
1 0

input

4
-1 -2 -3 0

output

1 -1
2 -3 -2
1 0

//   题意 ：   第一行所有元素相乘小于零  输出元素的个数n1和n1 个 元素

//                   第二行所有元素相乘大于零  输出元素的个数n2和n2个 元素

//                   第二行所有元素相乘等于零  输出元素的个数n3和n3个 元素

//                   有多种输出情况任选一种即可

// 解题思路： 输入元素 先sort  然后把>0 <0   =0分成三个数组存起来   

 //                     第一行输出一个<0 的元素 

//                      第二行把所有的>0 的全输出且按<0的个数分两种情况考虑  

//                      第三行也是两种情况考虑

//代码如下：

#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
	int n,i,j,k,l,a,b,c;
	int a1[1000];
	int a2[1000];
	int a3[1000];
	int a4[1000];
	while(scanf("%d",&n)!=EOF)
	 {
	 	j=k=l=0;
		for(i=0;i<n;i++)
		 scanf("%d",&a1[i]);
		sort(a1,a1+n);
		for(i=0;i<n;i++)
		 {
		 	if(a1[i]<0)
		 	 {
		 	 	a2[j]=a1[i];
		 	 	j++;
			 }
			else if(a1[i]==0)
			 {
				a3[k]=a1[i];
		 	 	k++;
			 }
			else
			 {
			 	a4[l]=a1[i];
		 	 	l++;
			 }
		 }
		 
		printf("1 %d\n",a2[0]);
		
		if(j>=3)
		 {
		 	printf("%d ",2+l);
		    printf("%d %d",a2[1],a2[2]);
		    for(i=0;i<l;i++)
		     printf(" %d",a4[i]);
		 }
		else
		 {
		 	printf("%d",l);
		 	for(i=0;i<l;i++)
		     printf(" %d",a4[i]);
		 }
		 printf("\n");
		 
		 if(j>=3)
		 {
		 	printf("%d",j-3+k);
		 	if(j==3)
		 	 {
		 	 	for(i=0;i<k;i++)
		 	 	 printf(" %d",a3[i]);
			  }
			else
			  {
			  	for(i=3;i<j;i++)
			  	 printf(" %d",a2[i]);
			  	for(i=0;i<k;i++)
		 	 	 printf(" %d",a3[i]);
			  }
		 }
		 else
		  {
		  	if(j==3||j==2)        //注意。。这个。。点。。 
		  	{
		  			printf("%d",k+1);
					  printf(" %d",a2[1]);
		  	        for(i=0;i<k;i++)
		 	 	     printf(" %d",a3[i]);
			}
		   else
		     {
		     	printf("%d",k);
		  	        for(i=0;i<k;i++)
		 	 	     printf(" %d",a3[i]);
			 }
		  	
		  }
		printf("\n");
	 }
return 0;
}