Hello Guys.. I was trying to solve This atcoder problem From the last beginner contest but i was not able to come up with a working solution during the contest...After some upsolving, i finally came up with a solution that seems to work but the only problem is that it get's TLE on all the tests except the first three for which it passes and I don't know/understand why. This was the first ever ABC problem D that i have attempted after reading the problem statement.

This is the code below and I just need a little help or maybe come hints as to how to make the work because i can't think of a way to optimize it further. ~~~~~

include

include

include

include

include

pragma GCC optimize ("O3")

pragma GCC target ("sse4")

using namespace std;

int check(vector a){ int q = a.size(); set s; for(int i = 0; i < q; i++){ s.insert(a[i]); } return s.size(); } void solve(){ int n , t; cin >> n >> t; vector mex; for(int i = 0; i < n; i++) mex.push_back(0); for(int i = 0; i < t; i++){ int a, b; cin >> a >> b; mex[a-1] += b; cout << check(mex) << endl; } } int main (){ ios::sync_with_stdio(false); cin.tie(nullptr); //ll t; cin >> t; //for(;t--;){ solve(); //} return 0; }

~~~~~