Submission #1301181

#TimeUsernameProblemLanguageResultExecution timeMemory
1301181yus1f_mKnapsack (NOI18_knapsack)C++20
12 / 100
1 ms572 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() #define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m,num1,num2,num3,ans; cin>>n>>m; vector<tuple<ll,ll,ll>>nums; for(int i=0;i<m;i++) { cin>>num1>>num2>>num3; nums.pb({num1,num2,num3}); } ans=get<0>(nums[0])*min(n/get<1>(nums[0]),get<2>(nums[0])); cout<<ans; } int main() { fastIO; ll t=1; //cin>>t; while(t--) { solve(); } }
#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...