# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060993 | Sir_Ahmed_Imran | Wiring (IOI17_wiring) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define MAXN 201
ll dp[MAXN][MAXN];
ll min_total_length(vector<int> r,vector<int> b){
int n,m;
dp[0][0]=0;
n=r.size();
m=b.size();
for(int i=1;i<=m;i++)
dp[0][i]=1e18;
for(int i=1;i<=n;i++)
dp[i][0]=dp[i-1][0]+abs(r[i-1]-b[0]);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
dp[i][j]=min(dp[i][j-1],dp[i-1][j-1])+abs(r[i-1]-b[j-1]);
return dp[n][m];
}
void solve(){
int n,m,o;
cin>>n>>m;
vector<int> r,b;
for(int i=0;i<n;i++){
cin>>o;
r.append(o);
}
for(int i=0;i<m;i++){
cin>>o;
b.append(o);
}
cout<<min_total_length(r,b)<<nl;
}
int terminator(){
L0TA;
solve();
return 0;
}