제출 #881773

#제출 시각아이디문제언어결과실행 시간메모리
881773MicrofsKnapsack (NOI18_knapsack)C++14
컴파일 에러
0 ms0 KiB
#include <iostream> #include <vector> #include <cstring> #include <algorithm> #include <climits> using namespace std; const int MAXN = 2003; long long dp[MAXN]; vector<vector<long long>> items(2003); int main(){ for(int i =0; i < MAXN; i++)dp[i]=0; int s,n; cin >> s >> n; for(int i = 0; i < n; i++){ int v,w,k; cin >> v >> w >> k; for(int i = 0; i < s/w; i++){ if(i >= k)break; items[w].push_back(v); } } int maxmax = -1; for(int i =0; i <= s; i++)sort(items[i].begin(),items[i].end(),greater<int>()); for(int i = 1; i <= s; i++){ // item ind int smol = min((int)items[i].size(),s/i); for(int j = 0; j < smol; j++){ //num of items taken for(int k = s; k >= i; k--){ dp[k] = max(dp[k], dp[k-i]+items[i][j]); } } } for(int i =0; i < MAXN; i++)maxmax = max(maxmax,dp[i]); cout << maxmax << endl; }

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:31:59: error: no matching function for call to 'max(int&, long long int&)'
   31 |     for(int i  =0; i < MAXN; i++)maxmax = max(maxmax,dp[i]);
      |                                                           ^
In file included from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/ostream:38,
                 from /usr/include/c++/10/iostream:39,
                 from knapsack.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
knapsack.cpp:31:59: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   31 |     for(int i  =0; i < MAXN; i++)maxmax = max(maxmax,dp[i]);
      |                                                           ^
In file included from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/ostream:38,
                 from /usr/include/c++/10/iostream:39,
                 from knapsack.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
knapsack.cpp:31:59: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   31 |     for(int i  =0; i < MAXN; i++)maxmax = max(maxmax,dp[i]);
      |                                                           ^
In file included from /usr/include/c++/10/algorithm:62,
                 from knapsack.cpp:4:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
knapsack.cpp:31:59: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   31 |     for(int i  =0; i < MAXN; i++)maxmax = max(maxmax,dp[i]);
      |                                                           ^
In file included from /usr/include/c++/10/algorithm:62,
                 from knapsack.cpp:4:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
knapsack.cpp:31:59: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   31 |     for(int i  =0; i < MAXN; i++)maxmax = max(maxmax,dp[i]);
      |                                                           ^