Timus online judge 1025. Democracy in Danger

Problem link



A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

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

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

#define mx 100005
#define mod 10000007

int main()
{
    //freopen ("input.txt", "r", stdin);
    ll tc, n,a,b,ck=0,i,j;
    sc1(tc);
    ll arr[tc];

    for(i=0; i<tc; i++) sc1(arr[i]);

    sort(arr, arr+tc);

    for(i = 0; i<=tc/2; i++){
        ck+=(arr[i]+1)/2;
    }

    pf1(ck);

}