<p>A transaction is possibly invalid if:</p>

<ul>
	<li>the amount exceeds <code>$1000</code>, or;</li>
	<li>if it occurs within (and including) <code>60</code> minutes of another transaction with the <strong>same name</strong> in a <strong>different city</strong>.</li>
</ul>

<p>You are given an array of strings <code>transaction</code> where <code>transactions[i]</code> consists of comma-separated values representing the name, time (in minutes), amount, and city of the transaction.</p>

<p>Return a list of <code>transactions</code> that are possibly invalid. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Output:</strong> [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Explanation:</strong> The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;alice,50,1200,mtv&quot;]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;bob,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;bob,50,1200,mtv&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>transactions.length &lt;= 1000</code></li>
	<li>Each <code>transactions[i]</code> takes the form <code>&quot;{name},{time},{amount},{city}&quot;</code></li>
	<li>Each <code>{name}</code> and <code>{city}</code> consist of lowercase English letters, and have lengths between <code>1</code> and <code>10</code>.</li>
	<li>Each <code>{time}</code> consist of digits, and represent an integer between <code>0</code> and <code>1000</code>.</li>
	<li>Each <code>{amount}</code> consist of digits, and represent an integer between <code>0</code> and <code>2000</code>.</li>
</ul>

class Solution {
public:
    vector<string> invalidTransactions(vector<string> &transactions)
    {
        set<int> *t;
        vector<string> *v;
        tuple<string, int, int, string, int> *w;
        string name, name0, city, city0, tok;
        int amount, amount0, i, j, k, l, n, time, time0;

        n = transactions.size();
        w = new tuple<string, int, int, string, int>[n];
        for (i = 0; i < n; i++) {
            j = transactions[i].find(',');
            name = transactions[i].substr(0, j);
            k = transactions[i].find(',', ++j);
            tok = transactions[i].substr(j, k - j);
            time = std::stoi(tok);
            j = k + 1;
            k = transactions[i].find(',', j);
            tok = transactions[i].substr(j, k - j);
            amount = std::stoi(tok);
            city = transactions[i].substr(k + 1);
            w[i] = { name, time, amount, city, i };
        }
        std::sort(&w[0], &w[n],
                  [](tuple<string, int, int, string, int> a,
                     tuple<string, int, int, string, int> b) {
                      string nameA, nameB;
                      int timeA, timeB;

                      nameA = std::get<0>(a);
                      nameB = std::get<0>(b);
                      timeA = std::get<1>(a);
                      timeB = std::get<1>(b);

                      return (nameA == nameB) ? timeA < timeB :
                                                nameA < nameB;
                  });
        t = new set<int>();
        tie(name, time, amount, city, k) = w[0];
        for (i = 0; i < n; i++) {
            tie(name, time, amount, city, k) = w[i];
            if (amount > 1000)
                t->insert(k);
            for (l = i - 1; l >= 0; l--) {
                tie(name0, time0, amount0, city0, j) = w[l];
                if (name != name0 || time - time0 > 60)
                    break;
                if (city != city0) {
                    t->insert(j);
                    t->insert(k);
                }
            }
        }
        delete[] w;
        v = new vector<string>();
        for (int x : *t)
            v->push_back(transactions[x]);
        delete t;

        return *v;
    }
};
18000