For this Question: Numbers are awesome, larger numbers are more awesome!
Given an array A of size N, you need to find the maximum sum that can be obtained from the elements of the array (the selected elements need not be contiguous). You may even decide to take no element to get a sum of 0.The first line of the input contains the size of the array.
The next line contains N (white-space separated) integers denoting the elements of the array.


<b>Constraints:</b>
1 &le; N &le; 10<sup>4</sup>
-10<sup>7</sup> &le; A[i] &le;10<sup>7</sup>For each test case, output one integer representing the maximum value of the sum that can be obtained using the various elements of the array.Input 1:
5
1 2 1 -1 1

output 1:
5

input 2:
5
0 0 -1 0 0

output 2:
0

<b>Explanation 1:</b> 
In order to maximize the sum among [ 1 2 1 -1 1], we need to only consider [ 1 2 1 1] and neglect the [-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 sum = 0;
	for(int i = 1; i <= n; i++){
		int p;	cin >> p;
		if(p > 0)
			sum += p;
	}	
	cout << sum;
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?