Beta Round #43 (ACM-ICPC Rules), problem: (E) Comb 优先队列+晦涩题意
题意:给定n个数列,每个数列的长度为m,在i数列中从头取连续的ci个数字,最后要满足c1>c2
#include
#include
#include
#defineLLlonglong
#defineeps-1e17
usingnamespacestd;
constintLMT=1502;
LLdp[2][LMT],sum[LMT];
intn,m,tag;
structcmp
{
boolope