Educational Codeforces Round 33 (Rated for Div. 2) (C. Rumor)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int fx[]= {1,-1,0,0};

int fy[]= {0,0,-1,1};

const ll N=1e5+9;

vector<ll> graph[N];

ll store[N];

bool vis[N];

ll bfs(ll node)

{

    queue<ll>q;

    ll cost=store[node];

    vis[node]=true;

    q.push(node);

    while(!q.empty())

    {

        ll fro=q.front();

        q.pop();

        for(ll i=0; i<graph[fro].size(); i++)

            if(vis[graph[fro][i]]==false)

            {

                vis[graph[fro][i]]=true;

                cost=min(cost,store[graph[fro][i]]);

                q.push(graph[fro][i]);

            }

    }

    return cost;

}

int main()

{

    ll node,edge,a,b,sum=0;

    cin>>node>>edge;

    for(ll i=1; i<=node; i++)

        cin>>store[i];

    for(ll i=1; i<=edge; i++)

    {

        cin>>a>>b;

        graph[a].push_back(b);

        graph[b].push_back(a);

    }

    for(ll i=1; i<=node; i++)

        if(vis[i]==false)

            sum+=bfs(i);

    cout<<sum<<endl;

    return 0;

}

///Alhamdulillah

Problem Link:https://codeforces.com/problemset/problem/893/C