unordered_set<int> s;
for (int i=0; i<k; i++)
{
if (s.find(c[i])==s.end())
{
s.insert(c[i]);
printf("%d",c[i])
}
}
for (int i=0; i<k; i++)
{
if (s.find(c[i])==s.end())
{
s.insert(c[i]);
printf("%d",c[i])
}
}
(maintained by Lakshmi Sarvani Videla, Former Assistant Professor, KLEF and now Computer Science Lecturer, SRR and CVR Government Degree College, Vijayawada