编程填空：数据库内的学生信息

提示

#include <iostream>
#include <string>
#include <map>
#include <iterator>
#include <algorithm>
using namespace std;
// 在此处补充你的代码
struct Student 
{
    string name;
    int score;
};
template <class T>
void Print(T first,T last) {
    for(;first!= last; ++ first)
        cout << * first << ",";
    cout << endl;
}
int main()
{

    Student s[] = { {"Tom",80},{"Jack",70},
                    {"Jone",90},{"Tom",70},{"Alice",100} };

    MyMultimap<string,int> mp;
    for(int i = 0; i<5; ++ i)
        mp.insert(make_pair(s[i].name,s[i].score));
    Print(mp.begin(),mp.end()); //按姓名从大到小输出

    mp.Set("Tom",78); //把所有名为"Tom"的学生的成绩都设置为78
    Print(mp.begin(),mp.end());

    MyMultimap<int,string,less<int> > mp2;
    for(int i = 0; i<5; ++ i) 
        mp2.insert(make_pair(s[i].score,s[i].name));

    Print(mp2.begin(),mp2.end()); //按成绩从小到大输出
    mp2.Set(70,"Error");          //把所有成绩为70的学生，名字都改为"Error"
    Print(mp2.begin(),mp2.end());
    cout << "******" << endl;

    mp.clear();

    string name;
    string cmd;
    int score;        
    while(cin >> cmd ) {
        if( cmd == "A") {
            cin >> name >> score;
            if(mp.find(name) != mp.end() ) {
                cout << "erroe" << endl;
            }
            mp.insert(make_pair(name,score));
        }
        else if(cmd == "Q") {
            cin >> name;
            MyMultimap<string,int>::iterator p = mp.find(name);
            if( p!= mp.end()) {
                cout << p->second << endl;
            }
            else {
                cout << "Not Found" << endl; 
            }        
        }
    }
    return 0;
}

补充代码如下：

template <class T>
struct myless{
    bool operator()(const T & x,const T &y) const{
        return x>y;
    }
    //typedef T first_argument_type;
   // typedef T second_argument_type;
   // typedef bool result_type;
};
template<class Key, class T, class Pred = myless<Key> >
class MyMultimap{
public:
    typedef multimap<Key,T,Pred> my_type;
    typedef typename multimap<Key, T>::iterator iterator;
    my_type my_map;
    void insert(pair<Key, T> _p){
        my_map.insert(_p);
    }
    iterator find(Key k){
        return my_map.find(k);
    }
    iterator begin(){
        return my_map.begin();
    }
    iterator end(){
        return my_map.end();
    }
    void Set(Key k,T t){
        iterator e=my_map.equal_range(k).second;
        iterator s=my_map.equal_range(k).first;
        while(s!=e){
            s->second=t;
            s++;
        }
    }
    void clear(){
        my_map.clear();
    }
};
template <class T1,class T2>
ostream & operator << (ostream & os,const pair<T1, T2> &_p){
    os<<"("<<_p.first<<","<<_p.second<<")";
    return os;
}