[Java] Easy 100% solution
java []\nclass Solution {\n    public long minimumMoney(final int[][] transactions) {\n        int result = 0;\n        long tmp = 0;\n\n        for(final int[]
```java []\nclass Solution {\n    public long minimumMoney(final int[][] transactions) {\n        int result = 0;\n        long tmp = 0;\n\n        for(final int[] t : transactions) {\n            tmp += Math.max(0, t[0] - t[1]);\n            result = Math.max(result, Math.min(t[0], t[1]));\n        }\n\n        return result + tmp;\n    }\n}\n```
['Java']