map vector struct+sort

#include<map>#include <vector>#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#define MAXN 10using namespace std;typedef struct Node{    int x,y;    string name;    bool operator < (const Node & a) const{ /// http://bbs.csdn.net/topics/340163715        ///sort在实现的时候，里面用的是const对象，所以不能调用非const成员函数        return this->x < a.x;    }    Node(int x,int y,string name):x(x),y(y),name(name){}    Node():x(0),y(0),name("NULL"){} /// start -std=c++11    friend ostream& operator << (ostream &os,Node a){        os<<"x:"<<a.x<<" y:"<<a.y<<" name:"<<a.name;        return os;    }}Node;vector<Node> node{{1,10,"a"},{11,100,"b"},{111,1000,"c"},{}};map<int,vector<Node>>m;vector<vector<int> >v1;vector<int>v2[10];vector<int>v3;int main(){    sort(node.begin(),node.end());    for(vector<Node>::iterator it = node.begin();it != node.end();it++)        cout<<*it<<endl;    cout<<"===================================================="<<endl;    m[1].push_back(node[0]);    m[1].push_back(node[1]);    m[0].push_back(node[2]);    for(map<int,vector<Node>>::iterator it = m.begin();it != m.end();it++){        cout<<it->first<<endl;        for(vector<Node>::iterator itt = it->second.begin();itt != it->second.end();itt++)            cout<<"\t"<<"-->"<<*itt<<endl;    }    cout<<"===================================================="<<endl;    v3.push_back(1);        /// 动态二维数组    v3.push_back(2);    v3.push_back(3);    v1.push_back(v3);    v3.push_back(4);    v1.push_back(v3);    for(vector<vector<int>>::iterator it = v1.begin();it != v1.end();it++){        for(vector<int>::iterator itt = it->begin();itt != (*it).end();itt++)            cout<<*itt<<" ";        cout<<endl;    }    cout<<"===================================================="<<endl;    return 0;}