제출 #1326904

#제출 시각아이디문제언어결과실행 시간메모리
1326904jumpKnapsack (NOI18_knapsack)C++20
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #define int long long int value[100010]; int weight[100010]; int amount[100010]; int dpw[2010];//most cost secured from the weight signed main(){ int s,n; std::cin >> s >> n; for(int i=1;i<=n;i++){ std::cin >> value[i] >> weight[i] >> amount[i]; } for(int i=s;i>=0;i--){ for(int j=1;j<=n;j++){ for(int k=1;k<=std::min(amount[j],s);k++){ if(i-k*weight[j]<0)continue; dpw[i]=std::max(dpw[i-k*weight[j]]+k*value[i]); dpw[i]=std::max(dpw[i-1],dpw[i]); } } } //2000*2000*100000 std::cout << dpw[s]; }

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:17:32: error: no matching function for call to 'max(long long int)'
   17 |                 dpw[i]=std::max(dpw[i-k*weight[j]]+k*value[i]);
      |                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from knapsack.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
knapsack.cpp:17:32: note:   candidate expects 2 arguments, 1 provided
   17 |                 dpw[i]=std::max(dpw[i-k*weight[j]]+k*value[i]);
      |                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
knapsack.cpp:17:32: note:   candidate expects 3 arguments, 1 provided
   17 |                 dpw[i]=std::max(dpw[i-k*weight[j]]+k*value[i]);
      |                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
knapsack.cpp:17:32: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   17 |                 dpw[i]=std::max(dpw[i-k*weight[j]]+k*value[i]);
      |                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
knapsack.cpp:17:32: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   17 |                 dpw[i]=std::max(dpw[i-k*weight[j]]+k*value[i]);
      |                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~