1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T5f6,#include #include #include #include #include using namespace std; int N, M; int tot_cost = 1; // N*M 최대 100 * 100 vector c; vector m; deque>> v; vector> mem; void init(){ cin >> N >>M; c.resize(N+1); m.resize(N+1); for(int i=1; i<=N;++i) cin >> m[i]; for(int i=1; i<=N;++i) { cin >> c[i]; tot_cost += c[i]; } for(int i=1; i<=N;++i){ if(c[i]==0) { M -= m[i]; continue; } v.push_back({((float)c[i])/((float)m[i]), {c[i], m[i]}}); } sort(v.begin(), v.end()); v.push_front({-1, {-1, -1}}); mem.resize(v.size(), vector(tot_cost, 0)); } void calc(){ int ans = 10001; for(int i=1; i

제출 #132891

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: