[C++] Сортировка массива(как турнирной таблицы в футболе)

#include "stdafx.h"
#include <iostream>
#include <map>
#include <string>
#include <iomanip>
#include <functional>
using namespace std;
struct Team{
    Team(string n,int w,int t,int l,string g,int p) :
      name(n),win(w),tie(t),lose(l),goals(g),points(p)
      {}
  int points;
  string name;
  int win;
  int tie;
  int lose;
  string goals;
};
int _tmain(int argc, _TCHAR* argv[])
{
    Team a("Dnipro",2,0,0,"4-1",6);
    Team b("Shachtar",2,0,0,"5-2",6);
    Team c("Dynamo",1,1,0,"7-2",4);
    Team d("Kharkov",1,0,1,"3-3",3);
    multimap<int,Team,greater<int> > m;
    m.insert(multimap<int,Team>::value_type(int(a.points),
        Team(a)));
    m.insert(multimap<int,Team>::value_type(int(b.points),
        Team(b)));
    m.insert(multimap<int,Team>::value_type(int(c.points),
        Team(c)));
    m.insert(multimap<int,Team>::value_type(int(d.points),
        Team(d)));
    multimap<int,Team,greater<int> >::iterator it = m.begin();
    cout<<setw(8)<<"Team"<<setw(8)<<"w"<<setw(4)<<"t"<<setw(4)<<
        "l"<<setw(4)<<"g"<<setw(8)<<"p"<<"\n\n";
    for(;it != m.end();++it){
        cout<<setw(8)<<(it->second).name<<setw(8)<<(it->second).win<<setw(4)<<
            (it->second).tie<<setw(4)<<(it->second).lose<<setw(4)<<
            setw(6)<<(it->second).goals<<setw(6)<<(it->second).points<<endl;
    }
    return 0;
}