Sereja and Dima

int n;
    cin >> n;
    int a[n];
    ll sum_s = 0,sum_d = 0;
    for (int i = 0; i < n;i++)
        cin >> a[i];
    sort(a, a + n);
    for (int i = 0; i < n;i++)
    {
        if(i%2==0)
          sum_s += a[i];
    }
    for (int i = 0; i < n;i++)
    {
        if(i%2)
           sum_d += a[i];
    }
    if(sum_d>sum_s)
        swap(sum_d, sum_s);
    cout << sum_s << " " << sum_d;