#include // created [2019/12/19] 21:42:53 #pragma GCC diagnostic ignored "-Wsign-compare" #pragma GCC diagnostic ignored "-Wsign-conversion" using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; using uint = unsigned int; using usize = std::size_t; using ll = long long; using ull = unsigned long long; using ld = long double; template using arr = T (&)[n]; template using c_arr = const T (&)[n]; template constexpr T popcount(const T u) { return u ? static_cast(__builtin_popcountll(static_cast(u))) : static_cast(0); } template constexpr T log2p1(const T u) { return u ? static_cast(64 - __builtin_clzll(static_cast(u))) : static_cast(0); } template constexpr T msbp1(const T u) { return log2p1(u); } template constexpr T lsbp1(const T u) { return __builtin_ffsll(u); } template constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast(u); } template constexpr bool ispow2(const T u) { return u and (static_cast(u) & static_cast(u - 1)) == 0; } template constexpr T ceil2(const T u) { return static_cast(1) << clog(u); } template constexpr T floor2(const T u) { return u == 0 ? static_cast(0) : static_cast(1) << (log2p1(u) - 1); } template constexpr bool btest(const T mask, const usize ind) { return static_cast((static_cast(mask) >> ind) & static_cast(1)); } template void bset(T& mask, const usize ind) { mask |= (static_cast(1) << ind); } template void breset(T& mask, const usize ind) { mask &= ~(static_cast(1) << ind); } template void bflip(T& mask, const usize ind) { mask ^= (static_cast(1) << ind); } template void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); } template constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast(0) : static_cast((static_cast(mask) << (64 - ind)) >> (64 - ind)); } template bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); } template bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); } constexpr unsigned int mod = 1000000007; template constexpr T inf_v = std::numeric_limits::max() / 4; template constexpr Real pi_v = Real{3.141592653589793238462643383279502884}; auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward(args)...); }; }; template T in() { T v; return std::cin >> v, v; } template T in_v(typename std::enable_if<(i == n), c_arr>::type) { return in(); } template auto in_v(typename std::enable_if<(i < n), c_arr>::type& szs) { const usize s = (usize)szs[i]; std::vector(szs))> ans(s); for (usize j = 0; j < s; j++) { ans[j] = in_v(szs); } return ans; } template auto in_v(c_arr szs) { return in_v(szs); } template auto in_t() { return std::tuple...>{in()...}; } struct io_init { io_init() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(20); } void clear() { std::cin.tie(), std::ios::sync_with_stdio(true); } } io_setting; template int out(const T& v) { return std::cout << v, 0; } template int out(const std::vector& v) { for (usize i = 0; i < v.size(); i++) { if (i > 0) { std::cout << ' '; } out(v[i]); } return std::cout << "\n", 0; } template int out(const std::pair& v) { return out(v.first), std::cout << ' ', out(v.second), 0; } template int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; } template int outln(const Args... args) { return out(args...), std::cout << '\n', 0; } template void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; } # define SHOW(...) static_cast(0) constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; } template auto make_v(typename std::enable_if<(i == n), c_arr>::type, const T& v = T{}) { return v; } template auto make_v(typename std::enable_if<(i < n), c_arr>::type szs, const T& v = T{}) { const usize s = (usize)szs[i]; return std::vector(szs, v))>(s, make_v(szs, v)); } template auto make_v(c_arr szs, const T& t = T{}) { return make_v(szs, t); } template struct flow { using capacity_type = Cap; flow(const usize v) : sz(v), edges(v) {} void add_edge(const usize from, const usize to, const capacity_type cap) { edges[from].push_back({to, edges[to].size(), cap, false}), edges[to].push_back({from, edges[from].size() - 1, 0, true}); } struct edge { usize to, rev; capacity_type cap; const bool is_rev; }; const std::vector& operator[](const usize i) const { return edges[i]; } std::vector& operator[](const usize i) { return edges[i]; } friend std::ostream& operator<<(std::ostream& os, const flow& f) { os << "[\n"; for (usize i = 0; i < f.size(); i++) { for (const auto& e : f[i]) { if (not e.is_rev) { os << i << "->" << e.to << ":" << e.cap << "\n"; } } } return (os << "]\n"); } usize size() const { return sz; } private: const usize sz; std::vector> edges; }; template Cap ford_fulkerson(flow& flow, const usize s, const usize t) { std::vector checked(flow.size()); auto dfs = [&](auto&& self, const usize pos, const Cap f) -> Cap { if (pos == t) { return f; } checked[pos] = true; for (auto& e : flow[pos]) { if (e.cap == 0 or checked[e.to]) { continue; } const Cap d = self(self, e.to, std::min(f, e.cap)); if (d <= 0) { continue; } e.cap -= d, flow[e.to][e.rev].cap += d; return d; } return 0; }; Cap f = 0; while (true) { std::fill(checked.begin(), checked.end(), false); const Cap df = dfs(dfs, s, inf_v); if (df == 0) { break; } f += df; } return f; } int main() { const auto [H, W] = in_t(); const auto G = in_v({H, W}); auto R = in_v({H}); auto C = in_v({W}); for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { R[i] -= G[i][j]; C[j] -= G[i][j]; } } flow f(H * W + H + W + 2); const int S = H * W + H + W; const int T = H * W + H + W + 1; ll ans = 0; for (int i = 0; i < H; i++) { if (R[i] <= 0) { f.add_edge(S, i, 0); f.add_edge(i, T, -R[i]); } else { ans += R[i]; f.add_edge(S, i, R[i]); f.add_edge(i, T, 0); } } for (int j = 0; j < W; j++) { if (C[j] <= 0) { f.add_edge(S, H + j, 0); f.add_edge(H + j, T, -C[j]); } else { ans += C[j]; f.add_edge(S, H + j, C[j]); f.add_edge(H + j, T, 0); } } for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { const int v = i * W + j + H + W; ans += G[i][j]; f.add_edge(v, i, inf_v); f.add_edge(v, H + j, inf_v); f.add_edge(S, v, G[i][j]); f.add_edge(v, T, 0); } } SHOW(R, C); SHOW(f, S, T); outln(ans - ford_fulkerson(f, S, T)); return 0; }