502. IPO （List 与 vector 中的 erase 对比）

class Solution {
public:
    
struct node{
int p, c;

node(){}
node(int xx,int yy){
p = xx;
c = yy;
}

bool friend operator < (node t1 , node t2){

  if( t1.p != t2.p )
    return t1.p > t2.p;
 return t1.c < t2.c;
}

}  ;

int findMaximizedCapital(int k, int W, vector<int>& Profits, vector<int>& Capital)
{

    list<node>sto;

      int len = Profits.size() , ans = W;

      for(int i = 0 ; i < len ; i++){
        sto.push_back(node(Profits[i] , Capital[i]));
      }
      
      sto.sort();

      for(int i = 0 ; i < k; i++ ){
          
        if(sto.size() == 0)break;
        
        for(auto j = sto.begin(); j != sto.end() ; j++){

            if( j->c <= ans ){
                ans += j->p;
                sto.erase(j);
                break;
            }
        }
      }

    return ans;
}
    
};