Submission #1172275

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172275		dbekarys	Knapsack (NOI18_knapsack)	C++20	0 / 100	1 ms	1088 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
const int N=1e5+7;
const long long besk=1e18;
int used[N],p[N],c=0;
//vector<int>v[N];

int dp[107][N];
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    
    int n,m;
    cin>> n>>m;
    int a[n+1],b[n+1];
    for(int i=1,c;i<=n;i++){
        cin>> a[i]>>b[i]>>c;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            dp[i][j]=dp[i-1][j];
            if(a[i]<=j){
                dp[i][j]=max(dp[i][j],dp[i-1][j-a[i]]+b[i]);
            }
        }
    }
    cout<< dp[n][m];
}

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