For this Question: A long queue of people are waiting in front of ATMs because of the demonetization initiative. People arrive in groups to withdraw money due to the daily withdrawal limit per person. Groups come one by one and line up behind the already present queue. The way the groupings organize themselves is peculiar. The individuals in a given group arrange themselves in ascending order of height (not necessarily strictly increasing).

Sam notices a long queue standing in front of the nearby ATM. He is a curious child and wants to count all of the groups standing in line to withdraw money. Since groups are positioned behind one another, it is impossible to distinguish between them and provide an accurate count. Can you tell him the minimum number of groups that can be observed in the queue?The first line of input contains one positive integer N. The second line contains N space- separated integers H[i] denoting the height of i- th person. Each group has group members standing in increasing order of their height.

<b>Constraints</b>
1 &le; N &le; 1,000,000
1 &le; H[i] &le; 1,000,000Print the minimum number of groups that are at least present in the queue.Sample Input
4
1 2 3 4
Sample Output
1, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n ;
	cin>>n;
    int h[n];
    for(int i =0 ; i<n ; i++){
        cin>>h[i];
    }
    int ans = 1;
    for(int i=1 ; i<n ; i++){
        if(h[i]>=h[i-1]){
            continue;
        }
        else{
            ans++;
        }
    }
    cout<<ans;
	    
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?