Codeforces 300A Array 【模拟】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 100 + 10;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void add(LL &x, LL y) { x += y; x %= MOD; }
int a[MAXN];
map<int, bool> fp;
int main()
{
int n; cin >> n;
int cnt = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
cnt += a[i] > 0;
}
sort(a, a+n);
cout << 1 << ' ' << a[0] << endl;
bool flag = true;
if(cnt == 0) {
flag = false;
cout << 2 << ' ' << a[1] << ' ' << a[2] << endl;
}
else {
cout << 1 << ' ' << a[n-1] << endl;
}
if(flag) {
cout << n - 2;
for(int i = 1; i < n-1; i++) {
cout << ' ' << a[i];
}
cout << endl;
}
else {
cout << n - 3;
for(int i = 3; i < n; i++) {
cout << ' ' << a[i];
}
cout << endl;
}
return 0;
}