codeforces 437C The Child and Toy 贪心
2014-06-04 16:20
281 查看
C. The Child and Toy
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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
output
input
output
input
output
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.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 401 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.
#include <cstdlib> #include <cctype> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <iostream> #include <sstream> #include <map> #include <set> #include <queue> #include <stack> #include <fstream> #include <numeric> #include <iomanip> #include <bitset> #include <list> #include <stdexcept> #include <functional> #include <utility> #include <ctime> using namespace std; #define PB push_back #define MP make_pair #define REP(i,n) for(int i=0;i<(n);++i) #define FOR(i,l,h) for(int i=(l);i<=(h);++i) #define DWN(i,h,l) for(int i=(h);i>=(l);--i) #define CLR(vis) memset(vis,0,sizeof(vis)) #define MST(vis,pos) memset(vis,pos,sizeof(vis)) #define MAX3(a,b,c) max(a,max(b,c)) #define MAX4(a,b,c,d) max(max(a,b),max(c,d)) #define MIN3(a,b,c) min(a,min(b,c)) #define MIN4(a,b,c,d) min(min(a,b),min(c,d)) #define PI acos(-1.0) #define INF 0x7FFFFFFF #define LINF 1000000000000000000LL #define eps 1e-8 typedef long long ll; const int maxn=2222; int n,m; int a[maxn]; int main() { cin>>n>>m; FOR(i,1,n) scanf("%d",&a[i]); int x,y; int ans=0; REP(i,m) { scanf("%d%d",&x,&y); ans+=min(a[x],a[y]); } cout<<ans<<endl; return 0; }
相关文章推荐
- CodeForces 240D D. Merging Two Decks 解题报告 贪心
- CodeForces 675 C. Money Transfers(贪心)
- 【CodeForces】500B - New Year Permutation(Floyd)(贪心)
- CodeForces 342B Xenia and Spies (水题模拟,贪心)
- Codeforces 265D Good Sequences 贪心+DP
- 【codeforces 13 C】【DP + 离散化 + 贪心+滚动数组 】C. Sequence【用最小代价把序列变成非严格递增序列】
- Codeforces 722D Generating Sets【优先队列+贪心】
- Codeforces 479C Exams(贪心)
- Codeforces 3D Least Cost Bracket Sequence (贪心)
- 【打CF,学算法——三星级】CodeForces 645C Enduring Exodus (二分+贪心)
- 【Codeforces 534D】【贪心】Handshakes
- CodeForces - 731C Socks(并查集)(贪心)
- CodeForces - 707B Bakery(贪心)
- CodeForces 777B Game of Credit Cards【贪心】
- CodeForces 721D. Maxim and Array(贪心,思维题)
- codeforces - 337c Quiz【贪心】
- CodeForces 337B Preparing for the Contest(二分+贪心+优先队列)
- [codeforces] C - Efim and Strange Grade 模拟+贪心
- CodeForces 176A Trading Business 贪心
- [Codeforces 940.E] Cashback(dp,数据结构,贪心)