Team　formation　plays　an　essential　role　in　the　labor　market.　In　this　paper,　we　propose　two　bicriteria　algorithms　to　construct　a　balance　between　gain　and　cost　in　a　team　formation　problem　under　the　streaming　model,　subject　to　a　cardinality　constraint.　We　formulate　the　problem　as　maximizing　the　difference　of　a　non-negative　normalized　monotone　submodular　function　and　a　non-negative　linear　function.　As　an　extension,　we　also　consider　the　case　where　the　first　function　is　gamma-weakly　submodular.　Combining　the　greedy　technique　with　the　threshold　method,　we　present　bicriteria　streaming　algorithms　and　give　detailed　analysis　for　both　of　these　models.　Our　analysis　is　competitive　with　that　in　Ene＇s　work.