C++ 去重排序算法：高效处理重复数字

#include\u0020 #include\u0020 using\u0020namespace\u0020std;

int\u0020main()\u0020{ int\u0020N; cin\u0020>>\u0020N; set\u0020nums; for\u0020(int\u0020i\u0020=\u00200;\u0020i\u0020<\u0020N;\u0020i++)\u0020{ int\u0020num; cin\u0020>>\u0020num; nums.insert(num); } cout\u0020<<\u0020nums.size()\u0020<<\u0020endl; for\u0020(auto\u0020num\u0020:\u0020nums)\u0020{ cout\u0020<<\u0020num\u0020<<\u0020endl; } return\u00200; }