Submission #1048697

#	Time	Username	Problem	Language	Result	Execution time	Memory
1048697		tamir1	Knapsack (NOI18_knapsack)	C++17	0 / 100	1 ms	348 KiB

knapsack

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,S,i,res=0;
array<ll,3> p[100001];
bool cmp(array<ll,3> a,array<ll,3> b){
	if(double(a[0])/a[1]==double(b[0])/b[1]){
		return a[1]>b[1];
	}
	return double(a[0])/a[1]>double(b[0])/b[1];
}
int main(){
	cin >> S >> n;
	for(i=1;i<=n;i++){
		cin >> p[i][0] >> p[i][1] >> p[i][2];
	}
	sort(p+1,p+n+1,cmp);
	for(i=1;i<=n;i++){
		if(S>=p[i][1]){
			res+=p[i][0];
			S-=p[i][1];
		}
	}
	cout << res;
}

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