# codeforces #221(div2)B. I.O.U.

B. I.O.U.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Imagine that there is a group of three friends: A, B and С. A owes B 20 rubles and B owes C 20 rubles. The total sum of the debts is 40 rubles. You can see that the debts are not organized in a very optimal manner. Let's rearrange them like that: assume that A owes C 20 rubles and B doesn't owe anything to anybody. The debts still mean the same but the total sum of the debts now equals 20 rubles.

This task is a generalisation of a described example. Imagine that your group of friends has n people and you know the debts between the people. Optimize the given debts without changing their meaning. In other words, finally for each friend the difference between the total money he should give and the total money he should take must be the same. Print the minimum sum of all debts in the optimal rearrangement of the debts. See the notes to the test samples to better understand the problem.

Input

The first line contains two integers n and m (1 ≤ n ≤ 100; 0 ≤ m ≤ 104). The next m lines contain the debts. The i-th line contains three integers ai, bi, ci (1 ≤ ai, bi ≤ nai ≠ bi; 1 ≤ ci ≤ 100), which mean that person ai owes person bi ci rubles.

Assume that the people are numbered by integers from 1 to n.

It is guaranteed that the same pair of people occurs at most once in the input. The input doesn't simultaneously contain pair of people (x, y) and pair of people (y, x).

Output

Print a single integer — the minimum sum of debts in the optimal rearrangement.

Sample test(s)
Input
5 3
1 2 10
2 3 1
2 4 1

Output
10

Input
3 0

Output
0

Input
4 3
1 2 1
2 3 1
3 1 1

Output
0

Note

In the first sample, you can assume that person number 1 owes 8 rubles to person number 2, 1 ruble to person number 3 and 1 ruble to person number 4. He doesn't owe anybody else anything. In the end, the total debt equals 10.

In the second sample, there are no debts.

In the third sample, you can annul all the debts.

ps:我擦，这么简单的题目我在比赛的时候都没想出来，真不知道我到底怎么了，每天都在训练，但是感觉还是这么弱，我到底怎样提高啊。但是我绝对不会放弃的，我热爱它。

/*
@author : liuwen
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
const int maxn=200;
int G[maxn],n,m;
int main()
{
//freopen("in.txt","r",stdin);
while(cin>>n>>m){
int u,v,w;
memset(G,0,sizeof(G));
while(m--){
cin>>u>>v>>w;
G[u]-=w;
G[v]+=w;
}
int ans=0;
for(int i=1;i<=n;i++){
if(G[i]>0)  ans+=G[i];
}
cout<<ans<<endl;
}
return 0;
}


• 本文已收录于以下专栏：

## Codeforces Round #221 (Div. 2) B. I.O.U.

B. I.O.U. time limit per test 1 second memory limit per test 256 megabytes input s...

a

## Codeforces Round #343 (Div. 2) B. Far Relative’s Problem（O（1）的线段标记）

time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandar...

## 2016 Personal Training #8 Div.2 I - Lucky Numbers CodeForces 95B

CodeForces 95B 经过11遍的WA和TLE终于迈向胜利T_T，题不难但是要考虑很多细节，这种题也是接触太少以前都是嫌麻烦就放弃了，所以借这题也是有不少收获，在此告诫千万别放弃坚持就是胜利...

## 【Codeforces Round 271 (Div 2)B】【前缀和二分 or 暴力】Worms 每种类型多个个数第i个数什么类型

B. Worms time limit per test 1 second memory limit per test 256 megabytes input st...

## Codeforces Round #221 (Div. 2) A. Lever

A. Lever time limit per test 1 second memory limit per test 256 megabytes input st...

## 【Codeforces Round 274 (Div 2)C】【贪心】Exams a[i]位置写a[i]或b[i] 所有位置的数保证不下降的最早结束时间

C. Exams time limit per test 1 second memory limit per test 256 megabytes input st...

## G​R​O​U​P​ ​B​Y​,​W​H​E​R​E​,​H​A​V​I​N​G​之​间​的​区​别​和​用​法

having子句与where有相似之处但也有区别,都是设定条件的语句。  在查询过程中聚合语句(sum,min,max,avg,count)要比having子句优先执行.而where子句在查询过程中...
• newnazi
• 2014年06月01日 14:18
• 964

## 文章建立多样化的文字编排效果（<Hn>、<FONT>、<B>、<I>、<U>、<BIG>、<SMALL>、<STRIKE>、<BR>、<P>、<DIV>、<HR>）

举报原因： 您举报文章：codeforces #221(div2)B. I.O.U. 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)