this is my solution for problem c but it writes wrong answer on test 5 can you help me https://mirror.codeforces.com/contest/893/submission/70586366

can someone post your code for problem B?

my code is not working (rumor) can someone help me?

include<bits/stdc++.h>

using namespace std;

vector v[10000009];

long long w,y,n,ans,MIN,l[10000009],k,i; bool a[10000009],ok; void bfs(long long o) { if(a[o]==false) { a[o]=true; if(l[o]<MIN) MIN=l[o]; if(v[o].size()-1!=0) for(k=1;k<v[o].size();k++) { if(a[v[o][k]]==false) bfs(v[o][k]); } } } int main() { long long m; cin>>n>>m; for(i=1;i<=n;i++){ v[i].push_back(1); } for( i=1;i<=n;i++) { cin>>l[i]; }

if(m>0)
for(i=1;i<=m;i++)
{
    cin>>w>>y;
    v[w].push_back(y);
    v[y].push_back(w);
}
for(i=1;i<=n;i++)
{
    if(a[i]==false)
    {
       ok=true;
       MIN=l[i];
        bfs(i);    
        ans+=MIN;
    }
}

cout<<ans; }