제출 #720411

#제출 시각아이디문제언어결과실행 시간메모리
720411mseebacherKnapsack (NOI18_knapsack)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; struct Produkt{ ll v,w,k; }; int main(){ ios::sync_with_stdio(0); cin.tie(nullptr); cout << fixed << setprecision(8); int s,n; cin >> s >> n; vector<Produkt> p; for(int i = 0;i<n;i++){ cin >> p[i].v >> p[i].w >> p[i].k; } ll ans = s/p[0].w; cout << min(p[0].k,ans)*p[0].v; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...