Codeforces 437C The Child and Toy

On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.

The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remove all its parts. The child can remove a single part at a time, and each remove consume an energy. Let's define an energy value of part i as vi. The child spend vf1 + vf2 + ... + vfk energy for removing part i where f1, f2, ..., fk are the parts that are directly connected to the i-th and haven't been removed.

Help the child to find out, what is the minimum total energy he should spend to remove all n parts.

Input

The first line contains two integers n and m (1 ≤ n ≤ 1000; 0 ≤ m ≤ 2000). The second line contains n integers: v1, v2, ..., vn(0 ≤ vi ≤ 105). Then followed m lines, each line contains two integers xi and yi, representing a rope from part xi to part yi(1 ≤ xi, yi ≤ n; xi ≠ yi).

Consider all the parts are numbered from 1 to n.

Output

Output the minimum total energy the child should spend to remove all n parts of the toy.

Sample test(s)

input

4 3
10 20 30 40
1 4
1 2
2 3

output

40

input

4 4
100 100 100 100
1 2
2 3
2 4
3 4

output

400

input

7 10
40 10 20 10 20 80 40
1 5
4 7
4 5
5 2
5 7
6 4
1 6
1 3
4 3
1 4

output

160

Note

One of the optimal sequence of actions in the first sample is:

• First, remove part 3, cost of the action is 20.
• Then, remove part 2, cost of the action is 10.
• Next, remove part 4, cost of the action is 10.
• At last, remove part 1, cost of the action is 0.

So the total energy the child paid is 20 + 10 + 10 + 0 = 40, which is the minimum.

In the second sample, the child will spend 400 no matter in what order he will remove the parts.

解题思路：按照题目的要求我们容易知道每条边只删除一次，那如果我们在删除每条边的时候总是取对应两个端点中权值中较小者，那这样得出的结果肯定是最优的。那么是否存在这样一种删点的方案满足我们上述的情况呢？答案是肯定的，我们采用如下的方式求出，首先对于边(u, v)如果Wu > Wv则u点的删除应该在v点删除之前,我们从u到v连接一条有向边即u->v，根据这种规则我们便可以根据原图构造出一个DAG来，然后我们删除顶点的顺序便是按照拓扑排序的顺序来进行删除点的操作，这样我们最终求得的结果肯定是按照我们上述的结果来的，代码很简短。

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int w[maxn];

int main() {

    //freopen("aa.in", "r", stdin);

    int n, m, u, v;
    int ans = 0;
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &w[i]);
    }
    for(int i = 1; i <= m; ++i) {
        scanf("%d %d", &u, &v);
        ans += min(w[u], w[v]);
    }
    printf("%d\n", ans);
    return 0;
}