Lunar New Year approach Bob go receive red envelope countless money but collect money red envelope timeconsume process itselflet describe problem mathematical way consider timeline time 1 n the ith red envelope available time s_i t_i inclusive contain w_i coin if Bob choose collect coin ith red envelope integer point time s_i t_i inclusive can not collect envelope time d_i inclusive here s_i leq t_i leq d_i holdsBob greedy man collect coin greedily collect coin integer time x collect available red envelope maximum number coin if multiple envelope maximum number coin Bob choose parameter d large if multiple choice Bob choose randomlyhowever Alice daughter do not want father coin she disturb Bob m integer time moment if Alice decide disturb Bob time x time x resume usual strategy time x 1 inclusive lead miss red envelopescalculate minimum number coin Bob Alice disturb optimally