제출 #1193873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1193873		MunkhturErdenebat	Knapsack (NOI18_knapsack)	C++20	12 / 100	0 ms	328 KiB

knapsack

#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <iterator>
#include <set>
#include <stdlib.h>
 #define ll long long
 #define fr first
 #define sc second
 #define pb push_back
using namespace std;
    ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q[200005];
    map<ll,ll> see;
    map<ll,ll> mii,mee,maa;
    pair<double,ll> t[400005];
    vector<ll> vas[106],ves[205],vis,vii;
    string x,y[1000],z;
    pair<ll,ll> wefe,k[200005];
    priority_queue<ll> pq;
    stack<ll> munkh;
    set<ll> st;
int main(){
    cin>>a>>b;
    for(i=0 ; i<b ; i++){
        cin>>k[i].first>>k[i].second>>q[i];
        t[i].first=k[i].first/k[i].second;
        t[i].second=i;
    }
    sort(t,t+b);
    g=0;
    for(i=b-1 ; i>=0 ; i--){
        h=a/k[t[i].second].second;
        h=min(h,q[t[i].second]);
        a=a-h;
        h*=k[t[i].second].first;
        g+=h;
        
    }
    cout<<g<<endl;
}

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