제출 #1067484

#제출 시각아이디문제언어결과실행 시간메모리
1067484rohanjhaKnapsack (NOI18_knapsack)C++14
37 / 100
1060 ms165344 KiB
#include<iostream>
#include<vector>
using namespace std;
int main(){
    int s, n;
    cin>>s>>n;
    vector<vector<int> > item_list;
    for(int i=0; i<n; i++){
        int v, w, k;
        cin>>v>>w>>k;
        for(int j=1; j<=k; j++){
          vector<int> item;
           item.push_back(v);
            item.push_back(w);
            item_list.push_back(item);
        }
    }
    
    vector<int> dp(s+1, 0);
    for(int i=0; i<item_list.size(); i++){
        for(int j=s; j>=item_list[i][1]; j--){
            dp[j] = max(dp[j], dp[j-item_list[i][1]]+item_list[i][0]);
        }
    }
    std::cout<<dp[s]<<endl;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:20:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0; i<item_list.size(); i++){
      |                  ~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...