PAT2-12. 两个有序链表序列的交集

#include<cstdio>
#include<list>
#include<iterator>
#include<algorithm>
using namespace std;
int main(){

  list<int>a,b,c;
  int k;
  while(scanf("%d",&k),k!=-1)  a.push_back(k);
  while(scanf("%d",&k),k!=-1)  b.push_back(k);
  set_intersection(a.begin(),a.end(),b.begin(),b.end(),back_inserter(c));
  for(auto x:c){
    static bool first=true;
    if(first)first=false;
    else putchar(' ');
    printf("%d",x);
  }
  if(c.size()==0)printf("NULL");
  return 0;
}