Submission #1023696

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023696		vjudge1	Knapsack (NOI18_knapsack)	C++98	0 / 100	1 ms	344 KiB

knapsack

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
using namespace std; 
#define int long long
#define ff first
#define ss second
int mod = 1e9 + 7;

signed main(){
	ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
	int n , w;
	cin >> w >> n;
	int a[n] , b[n] , c[n];
	for(int i = 0; i < n; i++){
		cin >> a[i] >> b[i] >> c[i];
	}
	int res = 0;
	for(int i = 1; i <= c[0]; i++){
		if(a[i] * i > w){
			break;
		}
		res += a[i];
	}
	cout << res;
	return 0; 
}
//AZIM_BEST                    

                    

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