Language: C++

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n)  FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<Edge>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
  int H,W,ans=MAX;
  cin>>H>>W;
  int A[H][W],B[H][W],AB[H][W],DP[H][W][30000];
  REP(i,H){
    REP(j,W) cin>>A[i][j];
  }
  REP(i,H){
    REP(j,W) cin>>B[i][j];
  }
  REP(i,H){
    REP(j,W){
      AB[i][j]=abs(A[i][j]-B[i][j]);
      REP(k,30000) DP[i][j][k]=0;
    }
  }
  DP[0][0][15000+AB[0][0]]=1;
  DP[0][0][15000-AB[0][0]]=1;
  
  for(int i=0; i<=H-1; ++i){
    for(int j=0; j<=W-1; ++j){
      for(int k=1000; k<29000; ++k){
        if(i<=H-2){
          DP[i+1][j][k+AB[i+1][j]]+=DP[i][j][k];
          DP[i+1][j][k-AB[i+1][j]]+=DP[i][j][k];
        }
        if(j<=W-2){
          DP[i][j+1][k+AB[i][j+1]]+=DP[i][j][k];
          DP[i][j+1][k-AB[i][j+1]]+=DP[i][j][k];
        }
      }
    }
  }
  
  REP(i,30000){
    if(DP[H-1][W-1][i]>0) chmin(ans,(ll)abs(15000-i));
  }
  co(ans);
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:105:32: error: no matching function for call to 'chmin(int&, long long int)'
  105 |     if(DP[H-1][W-1][i]>0) chmin(ans,(ll)abs(15000-i));
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~
a.cc:60:23: note: candidate: 'template<class T> bool chmin(T&, const T&)'
   60 | template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
      |                       ^~~~~
a.cc:60:23: note:   template argument deduction/substitution failed:
a.cc:105:32: note:   deduced conflicting types for parameter 'const T' ('int' and 'long long int')
  105 |     if(DP[H-1][W-1][i]>0) chmin(ans,(ll)abs(15000-i));
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~