TLE in "End of Corruption" (ENDCORR) - please help!

help
,
1

I am getting TLE for this.

1 Like
2

If you use c++, a priority queue absolutely destroys the question.

Code snippet 
    int n,m;
    cin>>n>>m;
    priority_queue<int> people;
    for(int i=0;i<n+m;i++){
        int a;
        cin>>a;
        if(a==-1){
            cout<<people.top()<<"\n";
            people.pop();
            continue;
        }
        people.push(a);
    }
2 Likes
3

Here is my code

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;

int main(){

ll n,m; cin>>n>>m;

  vector<long long int>v;

ll y=m+n;

while(y--){
    
    ll x; cin>>x;
    
    if(x!=-1){
        
        v.push_back(x);
        
    }else{
        
        int j=0,max=0;
        
        for(int i=0;i<v.size();i++){
            
            if(max<v[i]){
                
                max=v[i];
                
                j=i;
            }
        }
        
        v[j]=0;
        
        cout<<max<<"\n";
    }
       
    
}
return 0;

}

1 Like
4

mine idea was of the same .

5

giving TLE.

6

I forget this priority_queue,simple one