<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) {
        vector<string> ans;
        int n = transactions.size();
        map<string, vector<pair<vector<int>,string>> > m;

        for(int i=0; i<n; i++){
            int sz=transactions[i].size();
            int comma = transactions[i].find(',');
            string name = transactions[i].substr(0,comma);
            int comma2 = transactions[i].substr(comma+1,sz).find(',');
            int time = stoi(transactions[i].substr(comma+1,comma+1+comma2));
            // cout << "time " << time << " " << comma << " " << comma2 << endl;
            comma=comma+1+comma2;
            comma2 = transactions[i].substr(comma+1,sz).find(',');
            // cout << comma << " " << comma2 << endl;
            // cout << transactions[i].substr(comma+1,comma+1+comma2);
            int price = stoi(transactions[i].substr(comma+1,comma2));

            comma=comma+1+comma2;
            comma2 = transactions[i].substr(comma+1,sz).find(',');
            string city = transactions[i].substr(comma+1,comma+1+comma2);
            // cout << name << " " << time << " " << price << " " << city << endl;
            if(m.find(name)==m.end()){
                vector<pair<vector<int>,string>> pq;
                pair<vector<int>,string> p = {{time,price,i},city};
                pq.push_back(p);
                m[name] = pq;
            }
            else{
                pair<vector<int>,string> p = {{time,price,i},city};
                m[name].push_back(p);
            }
        }
        // m contains the data
        for(auto it= m.begin(); it!=m.end(); it++){
            vector<pair<vector<int>,string>> pq = it->second;
            vector<int> visited(pq.size(),0);

            sort(pq.begin(), pq.end());
            for(int i = 0; i<pq.size(); i++){
                pair<vector<int>,string> mine = pq[i];

                if(mine.first[1]>1000){
                    if(!visited[i]){
                        cout << "larger " << mine.first[2] << endl;
                        ans.push_back(transactions[mine.first[2]]);
                        visited[i]=1;
                    }
                }

                for(int j=i; j<pq.size(); j++){
                    pair<vector<int>,string> your = pq[j];
                    if(your.first[0]-mine.first[0]<=60 && your.second!=mine.second){
                        if(!visited[i]){
                            cout << "earlier " << mine.first[2] << endl;
                            ans.push_back(transactions[mine.first[2]]);
                            visited[i]=1;
                        }
                        if(!visited[j]){
                            cout << "later " << your.first[2] << endl;
                            ans.push_back(transactions[your.first[2]]);
                            visited[j]=1;
                        }
                    }
                    if(your.first[0]-mine.first[0]>60){
                        break;
                    }
                }
            }

        }

        return ans;
    }
};
21500