Codeforces Round #683 (by Meet IT) DIV1 A問題 (500pt)
Codeforces Round #683 (by Meet IT) DIV2 C問題 (1250pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int N; ll W, A[2d5]; int ind[2d5];
int ress, res[2d5];
{
REP(rd_int()){
ll c = 0;
rd(N,W,A(N));
rep(i,N) ind[i] = i + 1;
sortA(N, A, ind);
ress = 0;
rrep(i,N) if(c + A[i] <= W){
c += A[i];
res[ress++] = ind[i];
}
if(c < W /+ 2) wt(-1), continue;
wt(ress);
wt(res(ress));
}
}
Current time: 2024年04月24日09時05分30秒
Last modified: 2020年11月16日03時02分09秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF683 CF_DIV1_A CF_DIV2_C
トップページに戻る
Logged in as: unknown user (not login)