제출 #651533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
651533		ChasingClouds	Knapsack (NOI18_knapsack)	C++14	12 / 100	919 ms	320 KiB

knapsack

/***AUTHOR: ChasingClouds***/

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

    int S, N;
    cin >> S >> N;

    vector<int> value(N);
    vector<int> weight(N);
    vector<int> copies(N);

    for(int i=0; i<N; i++) {
        cin >> value[i] >> weight[i] >> copies[i];
    }

    vector<int> VW(N);
    for(int i=0; i<N; i++) VW[i] = value[i]/weight[i];

    vector<int> pos(N);
    iota(pos.begin(), pos.end(), 0);

   //sort(VW.begin(), VW.end(), greater<int> ());
    sort(pos.begin(), pos.end(), [&](int i, int j){return VW[i] < VW[j];});
    reverse(pos.begin(), pos.end());
    int ans = 0;

    for(int i=0; i<N; i++) {
        while(copies[pos[i]]--) {
            if(S - weight[pos[i]] >= 0){
                ans += value[pos[i]];
                S = S - weight[pos[i]];
            }
        }
    }

    cout << ans;
	return 0;
}

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