For this Question: You are in charge of the cake for a child's birthday. You have decided the cake will have one candle for each year of their total age. They will only be able to blow out the tallest of the candles. Count how many candles are tallest.The first line contains a single integer, n, the size of candles[ ].
The second line contains n space- separated integers, where each integer i describes the height of candles[i].

<b>Constraints</b>
1 &le; n &le; 10<sup>5</sup>
1 &le; candles[i] &le; 10<sup>7</sup>-Sample Input
4
3 2 1 3
Sample Output 
2
Explanation
Candle heights are [3, 2, 1, 3]. The tallest candles are 3 units, and there are 2 of them., I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    
    int n;
    cin>>n;
    vector<int> a(n);
    for(auto &i : a){
        cin>>i;
    }
    int maxi = *max_element(a.begin(),a.end());
    cout<<count(a.begin(),a.end(),maxi)<<"\n";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?