哈理工OJ1164---去重合排序

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;

int main()
{

int N;
int count;
int a;
while (scanf("%d",&N)!=EOF)
{
list<int>ls;
list<int>::iterator ite;
count = 0;
while (N--)
{
scanf("%d",&a);
ls.push_back(a);
}
ls.sort();
ls.unique();
count = ls.size();
printf("%d\n",count);
for (ite=ls.begin();ite!=ls.end();ite++)
{
count--;
if (count==0)
{
printf("%d",*ite);
} 
else
{
printf("%d ",*ite);
}
}
}
return 0;
}