Codeforces Round #250 (Div. 2) -C. The Child and Toy
来源:互联网 发布:苹果恢复相册照片软件 编辑:程序博客网 时间:2024/05/22 06:18
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.
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 the minimum total energy the child should spend to remove all n parts of the toy.
4 310 20 30 401 41 22 3
40
4 4100 100 100 1001 22 32 43 4
400
7 1040 10 20 10 20 80 401 54 74 55 25 76 41 61 34 31 4
160
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.
思路:要花费最少的能量,那末每次就取最少的能量即可
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=10005;int v[maxn];int n,m; int main(){int i,j;while(scanf("%d %d",&n,&m)!=EOF){for(i=1;i<=n;i++)scanf("%d",&v[i]);int x,y,sum=0;while(m--){scanf("%d %d",&x,&y);sum+=min(v[x],v[y]);}cout<<sum<<endl;}return 0;}
- Codeforces Round #250 Div. 2(C.The Child and Toy)
- Codeforces Round #250 (Div. 2) -C. The Child and Toy
- Codeforces Round #250 (Div. 2) C. The Child and Toy 详解
- **Codeforces Round #250 (Div. 2) C. The Child and Toy ACM解题报告(贪心难题)
- Codeforces Round #250 (Div. 2) 437C The Child and Toy(脑洞贪心)
- Codeforces #250 (Div. 2) C.The Child and Toy
- Codeforces Round #250 (Div. 1) A. The Child and Toy
- Codeforces Round #250 Div1A Div2C 437C The Child and Toy 贪心
- codeforces 437C The Child and Toy
- CodeForces 437C The Child and Toy
- Codeforces 437C The Child and Toy
- codeforces-437C-The Child and Toy
- CodeForces 437C The Child and Toy
- Codeforces-437C-The Child and Toy
- CodeForces 437C The Child and Toy
- Codeforces Round #250 (Div. 2) A. The Child and Homework
- Codeforces Round #250 (Div. 2) A - The Child and Homework
- Codeforces Round #250 (Div. 2) -B. The Child and Set
- hdu 1027 next_permutation函数
- 外出免费WiFi,谨慎付款交易
- 给我涨涨积分吧分享了这么多了
- Eclipse Maven Project 转成 Dynamic Web Project
- Android学习笔记17——TCP/IP socket编程
- Codeforces Round #250 (Div. 2) -C. The Child and Toy
- 杭电acm1056 hdu-acm-1056解题报告
- HDU1143 - Tri Tiling(插头DP)
- hdoj.2052 Picture 20140804
- 排序算法实现
- Java提高篇(三五)-----Java集合细节(一):请为集合指定初始容量
- HDU 1251 统计难题 Trie题解
- hadoop分布式部署系列1:HDFS
- 编译opengl问题