排序的话利用sort,但是要用cmp函数,删除的话只可以覆盖
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct st
{
int a1;
string b1;
}arr[50];
bool cmp(const st &x, const st &y)
{
if (x.a1 == y.a1)
{
return x.b1 > y.b1;
}
else
{
return x.a1 < y.a1;
}
}
int main()
{
arr[0].a1 = 3; arr[0].b1 = "ccd";
arr[1].a1 = 2; arr[1].b1 = "edc";
arr[2].a1 = 1; arr[2].b1 = "gbf";
arr[3].a1 = 2; arr[3].b1 = "sdf";
sort(arr, arr + 4, cmp);
for (int i = 0; i < 4; i++)
{
cout << arr[i].a1 << " " << arr[i].b1 << endl;
}
cout << "删除元素就是讲数组后面的覆盖前面的" << endl;
for (int i = 0; i < 4; i++)
{
if (arr[i].b1 == "edc")
{
arr[i] = arr[i + 1];
}
}
for (int i = 0; i < 3; i++)
{
cout << arr[i].a1 << " " << arr[i].b1 << endl;
}
}