C - Censor KMP算法

Censor
frog is now a editor to censor so-called sensitive words (敏感词).

She has a long text p. Her job is relatively simple – just to find the first occurence of sensitive word w and remove it.

frog repeats over and over again. Help her do the tedious work.

Input
The input consists of multiple tests. For each test:

The first line contains 1 string w. The second line contains 1 string p.

(1≤length of w,p≤5*106, w,p consists of only lowercase letter)

Output
For each test, write 1 string which denotes the censored text.

对于这道题不知道说什么，我对KMP算法还是有些懵，花了一个上午,看几篇大佬的博客，也算是入了些门，这个题当时知道是用KMP算法的，但当时只是知道有这么个算法，没理解，看了别人的讲解让我不得不感叹kmp的强大，题目的思路我是看了一个大佬的博客，我只能说我还是太菜了。
思路来源，KMP，Hash两种解法

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<cstring>
using namespace std;
int n,m;
char a[5000005],b[5000005],ans[5000005];
int nextt[5000005];   
void getnext(){
    int j=0,k=-1;
    nextt[0]=-1;
    while (j<m-1){
        if (k==-1||b[j]==b[k]){
            j++;
            k++;
            nextt[j]=k;
        }
        else
            k=nextt[k];
    }
}
void kmp(){
	stack<int> st;
	stack<int> mt;
    int i = 0, j = 0;
    getnext();
    while (i < n){
        if(j == -1 || a[i] == b[j]){
            j++;i++;
            st.push(a[i-1]);
            mt.push(j);
       		if (j == m){   //这一句不知为何放到下面会WA
        		for(int i=0;i<m;i++){
        			st.pop();
        			mt.pop();
				}
				if(mt.empty()) j=0;
				else j=mt.top();
    		}
        }
        else{
            j = nextt[j];
        }     
    }
    int cnt=st.size()-1;
    ans[cnt+1]='\0';
    while(!st.empty()){
    	ans[cnt--]=st.top();
    	st.pop();
	}
	printf("%s\n",ans);
}
int main()
{
	while(scanf("%s",&b)!=EOF)
	{
		scanf("%s",&a);
		m=strlen(b);
		n=strlen(a);
		if(m>n){
			printf("%s\n",a);
			continue;
		}
		kmp();
	}
	return 0;
}