one definition of key polynomials is as the weight generating functions of key tableaux. assaf and schilling introduced a crystal structure on key tableaux and related it to morse–schilling crystals on reduced factorizations for permutations via weak edelman–greene insertion. in this talk, we consider generalizations of both crystals depending on a flag. we extend weak eg insertion to a bijection between our flagged objects and show that the recording tableau gives a crystal isomorphism. as an application, we show that flagged key tableaux have a natural demazure crystal structure, whose characters recover reiner and shimozono’s flagged key polynomials.