Codeforces_(A).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 a₁, 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.

Sample test(s)

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

看了一大堆英文刚开始有点犯晕，其实题目很简单，就是给你一个无序数组让你把它分成3类：

第一类：所有元素均小于0

第二类：所有元素均大于0

第三类：所有元素均等于0

所以看到这个，不用多说先快排，这个题目有一个注意点，就是分成的3个类不能为空集（至少得有一个元素）而且如果给定数组会有全大于等于0或者全小于等于0或全大于0或全小于0情况...但不管怎样我快排后首先输出第一个元素（因为他是最小的，不管它满不满足第一类都无所谓，因为满足输出没错误，不满足那后面的数就更不满足了，因为前面说了每个类不能为空集所以还是要输出它）然后再考虑快排后的最后一个数是大于0还是小于等于0，如果大于0那直接输出第二个数为第二类其它都为第三类（因为题目说了每个类至少有一个，所以一个类只有一个元素是符合题意的）否则就输出第二第三个数作为第二类其它为第三类

所以综上面敲出代码就很容易了...

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
   int n,i;
   cin>>n;
   int ar[n];
   for(i=0;i<n;i++)
   cin>>ar[i];
   sort(ar,ar+i);
   cout<<"1 "<<ar[0]<<endl;
   if(ar[n-1]>0)
   {
      cout<<"1 "<<ar[n-1]<<endl;
      cout<<n-2;
      for(i=1;i<n-1;i++)
      cout<<" "<<ar[i];
    }
   else
   {
     cout<<"2 "<<ar[1]<<" "<<ar[2]<<endl;
     cout<<n-3;
      for(i=3;i<n;i++)
         cout<<" "<<ar[i];
   }
}//如果有问题，或有什么疑惑，可以在评论中提出，小子我看到一定尽力解答