Codeforces 300A：Array（易错）

A. 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

题意：给你一个数组，你把这个数组分成三个集合，第一个集合的乘积<0，第二个集合的乘积>0，第三个集合的乘积=0.

解题思路：先排序，然后分情况，有四种情况：1.小于0的元素的个数为偶数且存在正数的元素；2.小于0的元素的个数为偶数且不存在正数的元素；

3.小于0的元素的个数为奇数且存在正数的元素；4.小于0的元素的个数为奇数且不存在正数的元素。

具体每种情况再怎么分就看代码了，一看就能懂。

代码如下：
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	int a[110];
	scanf("%d",&n);
	int cntxiao=0;
	int cntda=0;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		if(a[i]<0)
		cntxiao++;
		if(a[i]>0)
		cntda++;
	}
	sort(a,a+n);
	if(cntxiao%2==0)
	{
		if(a[n-1]>0)
		{
			printf("1 %d\n",a[0]);
			printf("%d",cntda);
			for(int i=cntxiao+1;i<n;i++)
			{
				printf(" %d",a[i]);
			}
			printf("\n");
			printf("%d 0",cntxiao);
			for(int i=1;i<cntxiao;i++)
			{
				printf(" %d",a[i]);
			}
			printf("\n");
		}
		else
		{
			printf("1 %d\n",a[0]);
			printf("%d",cntxiao-2);
			for(int i=2;i<cntxiao;i++)
			{
				printf(" %d",a[i]);
			}
			printf("\n");
			printf("2 0 %d\n",a[1]);
		}
	}
	else
	{
		if(a[n-1]>0)
		{
			printf("1 %d\n",a[0]);
			printf("%d",n-2);
			for(int i=1;i<n;i++)
			{
				if(a[i]==0)
				continue;
				printf(" %d",a[i]);
			}
			printf("\n");
			printf("1 0\n");
		}
		else
		{
			printf("1 %d\n",a[0]);
			printf("%d",n-2);
			for(int i=1;i<n-1;i++)
			{
				printf(" %d",a[i]);
			}
			printf("\n");
			printf("1 0\n");
		}
	}
	return 0;
}