-
Notifications
You must be signed in to change notification settings - Fork 3
/
Array.cpp
84 lines (73 loc) · 1.73 KB
/
Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
//********nikhiljugale007**********//
// this is updated file.
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<set>
#include<iterator>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll long long
#define v vector<ll int>
#define it iterator it
#define pb push_back
#define f(a,b) for(long long int i=a;i<b;i++)
#define fv(v) for(auto i=v.begin() ; i!=v.end();i++)
#define min min_element
#define max max_element
#define hell 1000000007
int main(){
fast;
#ifndef ONLINE_JUDGE
//Read input
freopen("input.txt","r",stdin);
//Write output
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
int arr[n];
vector<int> pos , neg , zero ;
int posC = 0 , negC = 0, zeroC = 0;
f(0,n){
cin>>arr[i];
if(arr[i]>0){
posC++;
pos.push_back(arr[i]);
}
else if(arr[i]<0){
negC++;
neg.push_back(arr[i]);
}
else{
zeroC++;
zero.push_back(arr[i]);
}
}
if(neg.size() %2 == 0 && neg.size() != 0){
zero.push_back(neg[neg.size()-1]);
neg.resize(neg.size()-1);
}
if(pos.size() == 0){
pos.push_back(neg[neg.size()-1]);
pos.push_back(neg[neg.size()-2]);
neg.resize(neg.size()-2);
}
cout<<neg.size()<<" ";
f(0,neg.size()){
cout<<neg[i]<<" ";
}
cout<<endl;
cout<<pos.size()<<" ";
f(0,pos.size()){
cout<<pos[i]<<" ";
}
cout<<endl;
cout<<zero.size()<<" ";
f(0,zero.size()){
cout<<zero[i]<<" ";
}
cout<<endl;
}