Односвязный список (18(2))

#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <map>

using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define pi (3.14159265358979323846264338327950288419716939937510)
#define unique(v) v.resize(unique(all(v)) - v.begin())
#define bipbup ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;

struct element
{
    D inf;
    element* next;
};
element * beg, * help, * last, * beg1, * help1, * last1;

int main()
{
    int n, m;
    cin >> n >> m;
    beg = new element;
    last = beg;
    for (int i = 0; i < n; ++i)
    {
        help = new element;
        cin >> help->inf;
        last->next = help;
        last = help;
    }
    last->next = NULL;
    last = beg->next;
    beg1 = new element;
    cin >> beg1->inf;
    last1 = beg1;
    for(int i = 1; i < m; ++i)
    {
        help1 = new element;
        cin >> help1->inf;
        last1->next = help1;
        last1 = help;
    }
    last1->next = NULL;
    last1 = beg;
    help = new element;
    help->next = beg->next;
    int k = 0;
    bool f(0);
    /*while(last1 && last)
    {
        if(last1->inf != last->inf)
        {
            last1 = beg1;
            help = help->next;
            k=0;
            continue;
        }
        k++;
        if(k == m)
        {
            beg->next = last->next;
            f = 1;
            last->next = NULL;
            break;
        }
        last1 = last1->next;
        last = last->next;
    }
    */
    while(help)
    {
        help1=help->next;
        delete help;
        help = help1;
    }

    help = beg->next;
    while (help)
    {
        cout << help->inf << ' ';
        help = help->next;
    }
    re 0;
}

/**
10
1 2 3 4 -5 6 7 8 9 10
**/