# 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...
• u011639256
• 2013年12月25日 00:28
• 786

## Codeforces Round #448 (Div. 2) B. XK Segments 排序+二分

• xiang_6
• 2017年11月27日 18:04
• 219

## B. I.O.U.

time limit per test 1 second memory limit per test 256 megabytes input standard input ...
• jj12345jj198999
• 2014年01月10日 15:18
• 1275

## Codeforces Round #457 (Div. 2) B. Jamie and Binary Sequence（思路+模拟）

B. Jamie and Binary Sequence (changed after round) time limit per test 2 seconds memory l...
• m0_37134257
• 2018年01月20日 15:09
• 89

## Codeforces 456 Div2

（写到一半突然断电。。。。。无力，原谅我不写题意了） B: 很显然，如果k=1k=1，答案就是n 若k≥2k≥2，答案就是n的第一个1开始，将后面所有位全部转换为1后的值。 #...
• qq_34454069
• 2018年01月06日 15:12
• 49

## Codeforces Round #214div2题解

A 直接判min(a, b) + min(c, d) B 按%k分类求和 或者暴力扫 C 把每个食物当成重量a - k * b, 价值a的物品 然后就是做背包问题求重量和为0的最优解 ...
• ztxz16
• 2013年11月25日 02:00
• 308

## codeforces #Round354-div2-B

• West___wind
• 2016年05月26日 14:12
• 192

## codeforces round #214 div2 CD

C. Dima and Salad time limit per test 1 second memory limit per test 256 megabytes input stand...
• u012350533
• 2013年11月25日 17:57
• 874

## 【解题报告】Codeforces Round #374 (Div. 2)

• TRiddle
• 2016年10月02日 00:50
• 416

## Codeforces 456 A. Laptops

• qingshui23
• 2015年07月07日 09:43
• 828

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