제출 #1301175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1301175		yusifm	Knapsack (NOI18_knapsack)	C++20	0 / 100	1 ms	568 KiB

knapsack

#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,sum=0,index=0,ans;
    cin>>n>>m;
    vector<tuple<ll,ll,ll>>nums;
    for(int i=0;i<m;i++)
    {
        cin>>num1>>num2>>num3;
        nums.pb({num2,num1,num3});
    }
    sort(all(nums));
    while(index<nums.size())
    {
        sum+=get<0>(nums[index]);
        if(sum>n)
        {
            break;
        }
        else
        {
            ans+=get<1>(nums[index]),index++;
        }
    }
    cout<<ans;
}
int main()
{
    fastIO;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27