vector 排序

/*

产生指定范围内的随机数 

  srand((unsigned)time(null)) //以时间产生随机种子

  产生n—>m的随机数 n+rand()%(m-n+1)

*/

#include <iostream>

#include <string>

#include <vector>

#include <algorithm>

#include <functional>

#include <stdlib.h>

#include <time.h>

#include <math.h>

using namespace std;

typedef struct mystruct

{

int a;

int b;

}mystruct;

int comp(mystruct obj1, mystruct obj2)

{

return obj1.a == obj2.a ? obj1.b < obj2.b: obj1.a < obj2.a;

}

void main()

{

vector<mystruct> my_vector;

mystruct datastruct;

srand((unsigned)time(NULL));

for (int i = 0; i < 10;i++)

{

datastruct.a = 1 + rand()%10;

datastruct.b = i;

my_vector.push_back(datastruct);

}

sort(my_vector.begin(),my_vector.end(),comp);

return ;

}

#include <vector>

#include <algorithm>

using namespace std;

 struct info

{

int num;

int count;

bool operator < (info b)

{

return num < b.num;

}

};

bool comp(info a, info b)

{

return a.num < b.num;

}

int main()

{

info myinfo;

   vector<info> MyVector;

for (int i = 0; i < 10; i ++)

{

myinfo.count = rand();

myinfo.num = rand();

    MyVector.push_back(myinfo);

}

sort(MyVector.begin(),MyVector.end());

sort(MyVector.begin(),MyVector.end(),comp);

return 0;

}