Codeforces 1092B. Teams Forming Solution


Solve in C++:

//AH Tonmoy
//Department of CSE ,Islamic University
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,ar[1000],i,j,s=0;
    while(cin>>n)
    {
        for(i=0; i<n; i++)
        {
            cin>>ar[i];
        }
        sort(ar,ar+n);
        for(i=0; i<n; i=i+2)
        {
            s=s+abs(ar[i+1]-ar[i]);
        }
         cout<<s<<endl;
            s=0;
    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.