Codeforces D. Balloons gym 101853 problem D

A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long int ll;


#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)
#define sc3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld\n",a,b,c)

#define fr(i,n) for(i=0;i<n;i++)
#define fr1(i,n) for(i=1;i<=n;i++)
#define frl(i,a,b) for(i=a;i<=b;i++)

vector<pair<string, string> >vc;
map<string, ll>my;
map<string, ll>::iterator it;


int main()
{
     ll n,m,t,i,j,a,b,ck=0,dk=0;

     sc1(t);

     while(t--){
        sc1(n);
        ll arr[n];
        ck = 0;
        for(i=0; i<n; i++){
            sc1(arr[i]);
            if(arr[i]>0)
                ck++;
        }
        pf1(ck);
     }

}