int solution(int n,vector<int>nums){
  priority_queue<long long, vector<long long>, greater<long long> > pq;
  long long S = 0;
  
  for(int i = 1;i <= n;i++){
    int x=nums[i-1];
    S += x;
    pq.push(x);
    
    while(S < 0){
      S -= pq.top();
      pq.pop();
    }
  }
  
  return (int) pq.size();
    }.