按字母顺序将对象插入向量 C++

Question

My goal is to make simple function that would insert objects to vector by keeping it alphabeticaly sorted so i can later easely search in vector.

This is my simplified example:

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

class Names {
public:
    Names(void);
    ~Names(void);
    bool Insert(const string & namer);
private:

    struct Person {
        string name;
    };
    vector<Person>people;
};

Names::Names() {
};

Names::~Names() {
};

bool Names::Insert(const string& namer) {
    Person p;
    p.name = namer;
    people.insert(upper_bound(people.begin(), people.end(), p), p);
}

int main(int argc, char** argv) {
    Names b1;
    bool status;
    status = b1 . Insert("John Smith");
    status = b1 . Insert("Bat Man");
    status = b1 . Insert("A Aron");
    return 0;
}

It doesnt work probably because upper_bound function cant compare string. Can anyone help me how to properly use insert function to insert into right spot ?

Thank you for any help.

Edit:

My problem is that my solution does not work because problems with compilation and i would like to find out why.

Answer 1

You should define operator < for class Person. For example it can be a member function of the class

struct Person {
    bool operator <( const pserson &rhs ) const { return ( name < rhs.name ); }
    string name;
};

Answer 2

Yes, you can use std::sort .

Takes three arguments,

Sort(your_vector.begin(),your_vector.end(),predicate)

You can define your predicate function to sort objects alphabetically.