警示后入TLE

 for( register int i = 1 ; i <= m ; i ++ ) 
    {
        if( input[ i ].id != 0 ) b.insert( input[ i ].id , input[ i ].cost ); 
        for( vector< pair< int , pair< int , int > > >::iterator it = died[ i ].begin() ; it != died[ i ].end() ; it ++ ) 
        {
            if( ( it -> second ).first < 0 ) 
            {
                ans[ it -> first ] -= b.ask( ( it -> second ).second ) ; 
                if( 0 - ( it -> second ).first > 1 ) ans[ it -> first ] += b.ask( 0 - ( ( it -> second ).first ) - 1 ) ;  
            }
            else 
            {
                ans[ it -> first ] += b.ask( ( it -> second ).second ) ;
                if( ( it -> second ).first > 1 ) ans[ it -> first ] -= b.ask( ( it -> second ).first - 1 ) ; 
            }
        }
    }

for( register int i = 1 ; i <= m ; i ++ ) 
    {
        // b.insert( input[ i ].id , input[ i ].cost ) ; 
        if( input[ i ].id != 0 ) b.insert( input[ i ].id , input[ i ].cost ); 
        while( l < died.size()&&died[ l ].first.first <= i )
        {
            if( died[ l ].first.second < 0 ) 
            {
                ans[ -died[ l ].first.second ] -= b.ask( died[ l ].second.second ) ; 
                if( died[ l ].second.first != 1 ) 
                ans[ -died[ l ].first.second ] += b.ask( died[ l ].second.first - 1 ) ;  
            }
            else 
            {
                ans[ died[ l ].first.second ] += b.ask( died[ l ].second.second ) ; 
                if( died[ l ].second.first != 1 ) 
                ans[ died[ l ].first.second ] -= b.ask( died[ l ].second.first - 1 ) ; 
            }
            l ++ ; 
            // cout << l << " " ; 
        }
    }