Rumor

最新推荐文章于 2023-10-30 22:54:24 发布

原创最新推荐文章于 2023-10-30 22:54:24 发布 · 932 阅读

0 ·

CC 4.0 BY-SA版权

并查集/最小生成树专栏收录该内容

24 篇文章

订阅专栏

Rumor

Vova promised himself that he would never play computer games... But recently Firestorm — a well-known game developing company — published their newest game, World of Farcraft, and it became really popular. Of course, Vova started playing it.

Now he tries to solve a quest. The task is to come to a settlement named Overcity and spread a rumor in it.

Vova knows that there are n characters in Overcity. Some characters are friends to each other, and they share information they got. Also Vova knows that he can bribe each character so he or she starts spreading the rumor; i-th character wants c_i gold in exchange for spreading the rumor. When a character hears the rumor, he tells it to all his friends, and they start spreading the rumor to their friends (for free), and so on.

The quest is finished when all n characters know the rumor. What is the minimum amount of gold Vova needs to spend in order to finish the quest?

Take a look at the notes if you think you haven't understood the problem completely.

Input

The first line contains two integer numbers n and m (1 ≤ n ≤ 10⁵, 0 ≤ m ≤ 10⁵) — the number of characters in Overcity and the number of pairs of friends.

The second line contains n integer numbers c_i (0 ≤ c_i ≤ 10⁹) — the amount of gold i-th character asks to start spreading the rumor.

Then m lines follow, each containing a pair of numbers (x_i, y_i) which represent that characters x_i and y_i are friends (1 ≤ x_i, y_i ≤ n, x_i ≠ y_i). It is guaranteed that each pair is listed at most once.

Output

Print one number — the minimum amount of gold Vova has to spend in order to finish the quest.

Example

Input

Output

Input

10 0
1 2 3 4 5 6 7 8 9 10

Output

Input

10 5
1 6 2 7 3 8 4 9 5 10
1 2
3 4
5 6
7 8
9 10

Output

Note

In the first example the best decision is to bribe the first character (he will spread the rumor to fourth character, and the fourth one will spread it to fifth). Also Vova has to bribe the second and the third characters, so they know the rumor.

In the second example Vova has to bribe everyone.

In the third example the optimal decision is to bribe the first, the third, the fifth, the seventh and the ninth characters.

题目大意：要散布谣言，让n个人知道，需要贿赂他们，第i个人被贿赂需要a[i]元，被贿赂的人可以免费帮忙散布谣言给认识的人，有m种关系，x与y有之间相互认识。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[100005],pre[100005];
int find(int x)
{
    if(x==pre[x])
        return x;
    else   \\这里不能直接改成  return  find（pre[x]），会超限。
    {
        pre[x]=find(pre[x]);
        return find(pre[x]);
    }
}
void join(int x,int y)
{
    int fx,fy;
    fx=find(x);
    fy=find(y);
    if(fx!=fy);
    pre[fy]=fx;
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        pre[i]=i;
    }
    int x,y;
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        join(x,y);
    }
    for(int i=1;i<=n;i++)   \\让花的钱尽可能小，找到互相有关系的人当中贿赂起来最便宜的。
        a[find(i)]=min(a[i],a[find(i)]);
    long long  ans=0;  \\这里不能用int，会过不了
    for(int i=1;i<=n;i++)
        if(i==pre[i])
            ans+=a[i];
    printf("%lld\n",ans);
    return 0;
}