알고리즘/대회 참여13 2020 ICPC Sinchon Summer Algorithm Camp Contest Open 참여 #include using namespace std; int W0, I0, T, D, I, A; int newWeight, newBm; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> W0 >> I0 >> T >> D >> I >> A; // not considering bm delta newWeight = W0 + (I - (I0 + A)) * D; if (newWeight > 0) cout > T; for (int i = 0; i > input; giant.push(input); } if (giant.top() K; line.resize(M); for.. 2020. 9. 6. 이전 1 2 3 다음
