Algorithm/Greedy (1) 썸네일형 리스트형 LUNCHBOX #include #include #include using namespace std; vector m, e; vector lunchSet; int minLunchTime(); int main() { int caseNum = 0; cin >> caseNum; int n, mInput = 0, eInput = 0; for (int cIter = 0; cIter > n; for (int i = 0; i > mInput; m.push_back(mInput); } for (int i = 0; i < n; i++) { cin .. 이전 1 다음