CodeForces 300A Array（快排）

Description
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:

The product of all numbers in the first set is less than zero ( < 0).
The product of all numbers in the second set is greater than zero ( > 0).
The product of all numbers in the third set is equal to zero.
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.

Sample Input
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

代码：

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int a[101],b[101],c[101];
		int q=0,w=0,e=0,k,i;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&k);
			if(k<0)
			{
			q++;
			a[q]=k;		
			}
			else if(k>0)
			{
			w++;
			b[w]=k;	
			}
			else
			{
			e++;
			c[e]=k;	
		}
		}
		if(w==0)
		{
			b[1]=a[q-1];
			b[2]=a[q];
			q=q-2;
			w=w+2;
		}
		if(q%2==0)
		{
			c[e+1]=a[q];
			q--;
			e++;
		}
		sort(a+1,a+1+q);
		sort(b+1,b+1+w);
		sort(c+1,c+1+e);
		printf("%d",q);
		for(i=1;i<=q;i++)
		printf(" %d",a[i]);
		printf("\n");
		printf("%d",w);
		for(i=1;i<=w;i++)
		printf(" %d",b[i]);
		printf("\n");
		printf("%d",e);
		for(i=1;i<=e;i++)
		printf(" %d",c[i]);
		printf("\n");
	}
	return 0;
}

题意：将所给的数分成三组，第一组所有乘积小于0，第二组所有数乘积大于0，第三组等于0；最后输出每组个数 还有每组的数。

思路：先将负数，正数和零分成三组，先判断第二组中有没有正数，没有的话肯定至少从第一组抽出两个数来。在判断第一组有多少个，偶数个的话就把其中一个给第三组，因为第三组所有的数乘积都为0.在输出就行了，注意每个数组换算时对应的个数也要随之加减。