64,639
社区成员
发帖
与我相关
我的任务
分享
struct Stu
{
int id;
string num;
};
int cmp1(const Stu& a, const Stu& b)
{
return a.num < b.num;
}
int eq(const Stu& a, const Stu& b)
{
return a.num == b.num;
}
int main()
{
vector<Stu> vec(4);
vec[0].id = 1, vec[0].num = "abc";
vec[1].id = 2, vec[1].num = "cde";
vec[2].id = 3, vec[2].num = "abc";
vec[3].id = 4, vec[3].num = "abc";
stable_sort(vec.begin(), vec.end(), cmp1);
int n = unique(vec.begin(), vec.end(), eq) - vec.begin();
for (int i = 0; i < n; ++i) cout << vec[i].id << " " << vec[i].num << endl;
return 0;
}