CodeForces 300A Array

最新推荐文章于 2021-02-09 09:42:13 发布

Never_Say-Never

最新推荐文章于 2021-02-09 09:42:13 发布

阅读量412

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/z1192277815/article/details/51533091

版权

水题专栏收录该内容

46 篇文章 0 订阅

订阅专栏

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 integersa₁, a₂, ..., a_n(|a_i| ≤ 10³) — the array elements.

Output

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

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

In the next line print integer n₃(n₃ > 0) — the number of elements in the third set. Then print n₃ 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.

题意：给一个含有n个元素的数组，要求将其划分为三个集合，第一个集合元素的乘积为负，第二个集合元素的乘积为正，第三个集合元素的乘积为0；要求每个集合至少有一个元素。将其数组按负数->正数->零的顺序排列，将最小的负数放在第一个集合，然后将最小的正数放在第二个集合，剩下的所有元素放在第三个集合；如果不存在正数，第一个集合不变，让后把剩下的元素中最小的两个负数放在第二个集合，最后将剩下的元素放在第三个集合。

代码如下：

#include<stdio.h>
#include<algorithm>
using namespace std;
struct node
{
	int num;
    int xh;	
}a[110];
int cmp(node a,node b)
{
	return a.xh<b.xh;
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int i;
		int n1=0,n2=0;
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i].num);
			if(a[i].num<0)
			{
			a[i].xh=-1;	
			n1++;
			}
			
			else if(a[i].num>0)
			{
				a[i].xh=1;	
				n2++;
			}
		
			else
			a[i].xh=2;
		}
		sort(a,a+n,cmp);
		printf("1 %d\n",a[0].num);
        if(n2!=0)
        {
            for(i=1;i<n;i++)
	     	{
			   if(a[i].xh==1)
			   {
			   	printf("1 %d\n",a[i].num);
			   	a[i].xh=-2;
			   	break;
			   }
	     	}	
        	printf("%d",n-2);
        	for(i=1;i<n;i++)
        	{
        		if(a[i].xh!=-2)
        		{
        			printf(" %d",a[i].num);
				}
			}
			printf("\n");
		}
		else
		{
			printf("2");
			for(i=1;i<3;i++)
			{
				printf(" %d",a[i].num);
			}
			printf("\n");
			printf("%d",n-3);
			for(i=3;i<n;i++)
			{
				
				printf(" %d",a[i].num);
			}
			printf("\n");
		}
	
	}
}