//先计算A-B的元素个数,然后冒泡排序
#include<stdio.h>
int
m
,
n;
int
i
,
j
,
k
,
fflag
;
int
flag
;
int
a
[
100
];
int b
[
100
];
int
c
[
100
];
int
main
()
{
while
(
scanf
(
"%d %d"
,
&
m
,
&
n))
{
fflag
=
0
;
k
=
0
;
if
(
m
==
0
&&
n
==
0
)
return
0
;
else
{
//********
//读入AB的位数
for
(
i
=
0
;
i
<
m
;
i
++
)
scanf
(
"%d"
,
&
a
[
i
]);
for
(
j
=
0
;
j
<
n;
j
++
)
scanf
(
"%d"
,
&
b
[
j
]);
//********
//判断A-B有几个元素,并存入数组c
//flag用作统计A中第i个元素与B中所有元素是否相同
for
(
i
=
0
;
i
<
m
;
i
++
)
{
flag
=
0
;
for
(
j
=
0
;
j
<
n;
j
++
)
{
if
(
a
[
i
]
!=
b
[
j
])
flag
++
;
}
if
(
flag
==
n)
{
c
[
k
]
=
a
[
i
];
k
=
k
+
1
;
fflag
=
1
;
}
}
//*******
//fflag用作标志位,0 标志A-B无元素输出NULL,否则对A-B元素进行排序
if
(
fflag
==
0
)
printf
(
"NULL"
);
else
{
for
(
i
=
0
;
i
<
k
;
i
++
)
{
for
(
j
=
i
;
j
<
k
;
j
++
)
{
if
(
c
[
i
]
>
c
[
j
])
{
c
[
i
]
=
c
[
j
]
+
c
[
i
];
c
[
j
]
=
c
[
i
]
-
c
[
j
];
c
[
i
]
=
c
[
i
]
-
c
[
j
];
}
}
printf
(
"%d "
,
c
[
i
]);
}
}
//********
printf
(
"
\n
"
);
}
}
return
1
;
}
int
int
int
int
int
int
int
{
}
//初学者伤不起啊