Language: C++

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
using namespace std;

bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}

long long gcd_(long long a, long long b){
  if(a<b){
    swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}


int main(){
  
  int n,k;
  cin>>n>>k;
  long long h[n];
  REP(i,n){
    cin>>h[i];
  }
  //iは残す。0~iまででj個残す。
  vector<vector<long long>> dp(n, vector<long long>(n+1, INF));
  REP(i,n){
    REP(j,n+1){
      if(j == 0){
        dp[i][j] = 0;
        continue;
      }
      REP(r,i){
        dp[i][j] = min(dp[i][j], dp[r][j-1] + max(h[i]-h[r], 0));
      }
    }
  }
  long long ans = INF;
  if(k>=n){
    cout<<0<<endl;
    return 0;
  }
  REP(i,n){
    for(int j = n; j>=n-k; j--){
      ans = min(ans, dp[i][j]);
    }
  }
  cout<<ans<<endl;
  return 0; 
}


Compiler output:
a.cc: In function 'int main()':
a.cc:69:50: error: no matching function for call to 'max(long long int, int)'
   69 |         dp[i][j] = min(dp[i][j], dp[r][j-1] + max(h[i]-h[r], 0));
      |                                               ~~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/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++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:69:50: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   69 |         dp[i][j] = min(dp[i][j], dp[r][j-1] + max(h[i]-h[r], 0));
      |                                               ~~~^~~~~~~~~~~~~~
/usr/include/c++/14/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++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:69:50: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   69 |         dp[i][j] = min(dp[i][j], dp[r][j-1] + max(h[i]-h[r], 0));
      |                                               ~~~^~~~~~~~~~~~~~