刚看像MST, 其实不是,求一下所有点的权值之后相加一下就是ans= =。。还没弄清原理就过了
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
#define N 2005
struct node{
int num, sum;
int nt[N/2], val[N/2];
}p[N/2];
int a[N];
int main()
{
int n, m;
while(~scanf("%d%d", &n, &m))
{
for(int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
p[i].num = 1;
p[i].sum = 0;
}
int u, v;
int ans = 0;
while(m--)
{
scanf("%d%d", &u, &v);
p[u].nt[p[u].num] = v;
p[u].val[p[u].num] = min(a[u], a[v]);
p[u].sum += p[u].val[p[u].num];
p[u].num++;
}
for(int i = 1; i <= n; i++)
{
ans += p[i].sum;
}
printf("%d\n", ans);
}
return 0;
}