minimum-money-required-before-transactions

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed 2D integer array <code>transactions</code>, where <code>transactions[i] = [costi, cashbacki]</code>.

The array describes transactions, where each transaction must be completed exactly once in some order. At any given moment, you have a certain amount of <code>money</code>. In order to complete transaction <code>i</code>, <code>money &gt;= costi</code> must hold true. After performing a transaction, <code>money</code> becomes <code>money - costi + cashbacki</code>.

Return the minimum amount of <code>money</code> required before any transaction so that all of the transactions can be completed regardless of the order of the transactions.

&nbsp;
Example 1:

<pre>
Input: transactions = [[2,1],[5,0],[4,2]]
Output: 10
Explanation:
Starting with money = 10, the transactions can be performed in any order.
It can be shown that starting with money &lt; 10 will fail to complete all transactions in some order.
</pre>

Example 2:

<pre>
Input: transactions = [[3,0],[0,3]]
Output: 3
Explanation:
- If transactions are in the order [[3,0],[0,3]], the minimum money required to complete the transactions is 3.
- If transactions are in the order [[0,3],[3,0]], the minimum money required to complete the transactions is 0.
Thus, starting with money = 3, the transactions can be performed in any order.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= transactions.length &lt;= 105</code></li>
	<li><code>transactions[i].length == 2</code></li>
	<li><code>0 &lt;= costi, cashbacki &lt;= 109</code></li>
</ul>

minimumMoney

Minimum Money Required Before Transactions

Greedy

Array

Sorting

给你一个下标从 0&nbsp;开始的二维整数数组&nbsp;<code>transactions</code>，其中<code>transactions[i] = [costi, cashbacki]</code>&nbsp;。

数组描述了若干笔交易。其中每笔交易必须以 某种顺序 恰好完成一次。在任意一个时刻，你有一定数目的钱&nbsp;<code>money</code>&nbsp;，为了完成交易&nbsp;<code>i</code>&nbsp;，<code>money &gt;= costi</code>&nbsp;这个条件必须为真。执行交易后，你的钱数&nbsp;<code>money</code> 变成&nbsp;<code>money - costi + cashbacki</code>&nbsp;。

请你返回 任意一种 交易顺序下，你都能完成所有交易的最少钱数&nbsp;<code>money</code>&nbsp;是多少。

&nbsp;

示例 1：

<pre>
输入：transactions = [[2,1],[5,0],[4,2]]
输出：10
解释：
刚开始 money = 10 ，交易可以以任意顺序进行。
可以证明如果 money &lt; 10 ，那么某些交易无法进行。
</pre>

示例 2：

<pre>
输入：transactions = [[3,0],[0,3]]
输出：3
解释：
- 如果交易执行的顺序是 [[3,0],[0,3]] ，完成所有交易需要的最少钱数是 3 。
- 如果交易执行的顺序是 [[0,3],[3,0]] ，完成所有交易需要的最少钱数是 0 。
所以，刚开始钱数为 3 ，任意顺序下交易都可以全部完成。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= transactions.length &lt;= 105</code></li>
	<li><code>transactions[i].length == 2</code></li>
	<li><code>0 &lt;= costi, cashbacki &lt;= 109</code></li>
</ul>