Submission #72009352

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N=1000100,INF=2e18,MOD=998244353;
int t,n,k,x,y,z,m,h,j,u,cnt,mi,tt,rr,mx,res,ans,ll,q;
int a[N],b[N],c[N];
signed main(){
    cin>>n>>m;
    string s;
    string ss;
    cin>>s;
    cin>>ss;
    s=' '+s;
    ss=' '+ss;
    ans=INF;
    for(int i=1;i<=n-m+1;i++){
        res=0;
        for(int j=1;j<=m;j++){
            if(s[i+j-1]>=ss[j]){
                res+=s[i+j-1]-ss[j];
            }else{
                res+=s[i+j-1]-ss[j]+10;
            }
        }
        ans=min(ans,res);
    }
    cout<<ans<<endl;


}

Submission Info

Judge Result