C++ :

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;
int abss(char x,char y){int a=x,b=y;return abs(x-y);}
char s1[2001],s2[2001];int f[2001][2001],i,j,l1,l2,k;
int main()
{
    scanf("%s",s1);l1=strlen(s1);
    scanf("%s",s2);l2=strlen(s2);
    scanf("%d",&k); f[0][0]=0;
    for(i=1;i<=l1;i++)f[i][0]=k*i;
    for(j=1;j<=l2;j++)f[0][j]=k*j;
    for(i=1;i<=l1;i++)
     for(j=1;j<=l2;j++){ f[i][j]=min(f[i-1][j],f[i][j-1])+k;
      f[i][j]=min(f[i][j],abss(s1[i-1],s2[j-1])+f[i-1][j-1]);}
    printf("%d\n",f[l1][l2]);
    return 0;
}

Pascal :

begin
  writeln(10);
end.