<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 {
private:
    static const int max_trans = 1000;

    class transaction {
    public:
        int     id;
        int     time;
        int     amt;
        string  *name;
        string  loc;

        transaction() = default;

        transaction(int t, string *nm) {
            time = t;
            name = nm;
        }

        transaction(int ident, int t, int amount, string *nm, string&& location) {
            id = ident;
            time = t;
            amt = amount;
            name = nm;
            loc = location;
        }

        bool operator<(const transaction& e) const {
            if (time == e.time)
                return *name == *e.name ? loc < e.loc : *name < *e.name;
            return time < e.time;
        }
    };

public:
    vector<string> invalidTransactions(vector<string>& transactions) {
        int i, n;
        multiset<transaction> s;
        vector<string> res;

        n = transactions.size();

        for (i = 0; i < n; i++) {
            int amt;
            int t;
            string loc;
            string *nm;
            string& str = transactions[i];
            string::iterator si, ei;

            ei = begin(str);
            for (;;) {
                if (*ei == ',') {
                    nm = new string(begin(str), ei);
                    break;
                }
                ++ei;
            }
            ++ei;
            si = ei;
            for (;;) {
                if (*ei == ',') {
                    t = stoi(string(si, ei));
                    break;
                }
                ++ei;
            }
            ++ei;
            si = ei;
            for (;;) {
                if (*ei == ',') {
                    amt = stoi(string(si, ei));
                    break;
                }
                ++ei;
            }
            if (amt > max_trans)
                res.push_back(str);
            loc = string(ei + 1, end(str));
            s.insert(transaction(i, t, amt, nm, std::move(loc)));
        }

        for (transaction trans : s) {
            multiset<transaction>::iterator iter;
            multiset<transaction>::iterator si, ei;

            if (trans.amt > max_trans)
                continue;

            si = s.lower_bound(transaction(trans.time - 60, trans.name));
            ei = s.upper_bound(transaction(trans.time + 60, trans.name));
            for (iter = si; iter != ei; ++iter) {
                transaction t;

                t = *iter;

                if (t.id == trans.id || *t.name != *trans.name)
                    continue;

                if (t.time > trans.time + 60)
                    break;

                if (t.loc != trans.loc) {
                    string str;

                    str = *trans.name;
                    str += "," + to_string(trans.time);
                    str += "," + to_string(trans.amt);
                    str += "," + trans.loc;
                    res.push_back(str);
                    break;
                }
            }
        }

        return res;
    }
};
17900