<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:
    class Data{
        public:
        int time;
        string city;
        int index;
        string name;
        int amount;
        
        Data(int time, string city, int index, string name, int amount){
            this->time = time;
            this->city = city;
            this->index= index;
            this->name = name;
            this->amount= amount;
        }
    };

    static bool cmp(Data* a, Data* b){
        return a->time <= b->time;
    }

    vector<string> invalidTransactions(vector<string>& transactions) {
        
        int n = transactions.size();
        vector<string> ans = {};
        vector<bool> invalid(n, false);
        vector<Data*> transs;

        unordered_map<string, vector<Data*>> mp;
       
        for(int it = 0 ; it < n ; ++it){
            string s = transactions[it];
            vector<string> tuple;
            int i = 0;
            while(i < s.size()){
                string temp = "";
                while(i < s.size() && s[i]!=','){
                    temp+=s[i++];
                }
                tuple.push_back(temp);
                i++;
            }
            string name = tuple[0], city = tuple[3];
            int time = stoi(tuple[1]), amount = stoi(tuple[2]);
            
            Data* newTrans = new Data(time, city, it, name, amount);
            transs.push_back(newTrans);
        }

        sort(transs.begin(), transs.end(), cmp);

        for(auto trans:transs){
            cout<<transactions[trans->index]<<" | ";
        }

        for(int it = 0 ; it< n ; ++it){
            string name = transs[it]->name, city = transs[it]->city;
            int time = transs[it]->time, amount = transs[it]->amount;
            int index = transs[it]->index;

            
            
            if(mp.find(name)!=mp.end()){
                int i = mp[name].size() -1;
                while(i >=0 && time - mp[name][i]->time<=60){
                    if(mp[name][i]->city!=city){
                        invalid[index] = true;
                        invalid[mp[name][i]->index] = true;
                    }
                    i--;
                }
            }

            if(amount>1000){
                invalid[index] = true;
            }
            

            mp[name].push_back(transs[it]);
        }

        for(int i = 0 ; i < n ; ++i){
            if(invalid[i]) ans.push_back(transactions[i]);
        }
        
        return ans;
    }
};
19500