<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:
    string concatVector(vector<string> &v){
        string st="";
        for(auto x:v)st+=x+",";
        st.pop_back();
        return st;
    }
    static bool cmp(vector<string>&v1,vector<string>&v2){
        if(v1[0]!=v2[0])return v1[0]<v2[0];
        else if(v1[1]!=v2[1]) return stoi(v1[1])<stoi(v2[1]);
        else return v1[3]<v2[3];
    }
    vector<string> invalidTransactions(vector<string>& transactions) {
        int i,j,n=transactions.size();
        vector<vector<string>>v;
        for(auto x:transactions){
            string str;
            vector<string>tmp;
            for(j=0;j<x.size();j++){
                if(j==(int)x.size()-1 || x[j]==','){
                    if(j==(int)x.size()-1)str+=x[j];
                    tmp.push_back(str);
                    str="";
                }
                else str+=x[j];
            }
            v.push_back(tmp);
        }
        sort(v.begin(),v.end(),cmp);
    
        set<pair<int,int>>st;
        set<int>stt;
        vector<string>res;

        for(i=0;i<n;i++){
        
            if(i==0 || v[i-1][0]==v[i][0]){
                auto tp1=st.rbegin();

                while(tp1!=st.rend() && stoi(v[i][1])-(tp1->first)<=60){
                    if(v[tp1->second][3]!=v[i][3] && stoi(v[i][1])-(tp1->first)<=60){
                        stt.insert(i);
                        stt.insert(tp1->second);
                    }
                    tp1++;
                }

            } else st.clear();
            st.insert({stoi(v[i][1]),i});
            
            if(stoi(v[i][2])>1000)stt.insert(i);
        }

        for(auto x:stt)res.push_back(concatVector(v[x]));

        return res;
    }
};
22500