multiset-end

////////////////////////////////////////
//      2018/04/30 9:26:40
//      multiset-end

//returns an iterator to the last element

#include <iostream>
#include <set>
#include <iomanip>
#include <string>

using namespace std;

template<class T>
class Member
{
private:
    T first, last;
public:
    Member(T l, T f) :last(l), first(f){}
    void print() const{
        cout.setf(ios::left);
        cout << setw(15) << first << " " << last << endl;
    }

    friend bool operator <(const Member& m1, const Member& m2){
        return m1.last < m2.last;
    }
};

//=======================
int main(){
    typedef Member<string> M;
    typedef multiset<M, less<M>> S;
    M m("Frost","Robert");

    S s;
    s.insert(m);
    s.insert(M("Smith","John"));
    s.insert(M("Amstrong","Bill"));
    s.insert(M("Bain","Linda"));

    S::iterator it = s.begin();
    while (it != s.end()){
        (it++)->print();
    }

    return 0;
}

/*
OUTPUT:
    Bill            Amstrong
    Linda           Bain
    Robert          Frost
    John            Smith
*/