ACM Min Distance

Problem Link: http://acm.epoka.edu.al:8888/en/problem-pid-c63d?ps=1&smt=9&smpwid=0





#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, a[10005],i,j,d,sum=0;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>a[i];
    }
    sort(a,a+n);
    for(i=0;i<n-1;i++)
    {
        //cout<<a[i]<<endl;
        d=abs(a[i]-a[i+1]);
        sum=sum+d;
    }
    cout<<sum<<endl;

    return 0;
}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here