双向链表的删除

#include <iostream>
#include"Infix.h"
using namespace std; 
int main()
{
int n,k;
cin>>n;
DuList L,p,pr;
CreatDuList(L,n);
cin>>k;
p=L->next;
pr=L;
if(k<=n){k=n-k;
while(k--)
{
    p=p->next;
    pr=pr->next;
}
pr->next=p->next;
p->next->prior=pr;
delete(p);}
OutPut(L);
    return 0;
}