For this Question: Given a binary array A[] of size N. The task is to arrange an array in increasing order.
(O(N) time complexity solution)Every test case contains two lines, first line contains an integer N (size of array) and second line contains space separated elements of array.

1 <= N <= 20
0 <= A[i] <= 1Print a single line containing space separated elements of sorted arrays.Input:
5
1 0 1 1 0

Output:
0 0 1 1 1, I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
 
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

signed main() {
	IOS;
	int n;	cin >> n;
	int a[2] = {0};
	for(int i = 1; i <= n; i++){
		int p;	cin >> p;
		a[p]++;
	}	
	for(int i = 0; i <= 1; i++)
		for(int j = 0; j < a[i]; j++)
			cout << i << " ";
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?