11pts求调

#include<bits/stdc++.h>
using namespace std;
int main(){
    string a,b;
    cin>>a>>b;
	int n=min(a.length(),b.length());
    int dp[n+1][n+1];
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            if(i==0){
                dp[i][j]=j;
            }else if(j==0)dp[i][j]=i;
            else if(a[i]==b[j]){
                dp[i][j]=dp[i-1][j-1];
            }else{
                dp[i][j]=dp[i-1][j-1]+1;
            }
        }
	}
	if(a.length()>b.length())cout<<dp[n][n]+a.length()-b.length();
    else cout<<dp[n][n]+b.length()-a.length();
}