C++ 结构体初始化

来源：互联网发布：身份证sql判断编辑：程序博客网时间：2024/06/07 03:24

http://www.cnblogs.com/Vincent-Bryan/p/6622790.html

#include<bits/stdc++.h>using namespace std;struct Node{    int M, V;    Node(int a, int b){        M = a;        V = b;    }};int main(){    Node n1(1, 65), n2(5, 23), n3(2, 99);    cout << n1.M << ' ' << n1.V << endl;    cout << n2.M << ' ' << n2.V << endl;    cout << n3.M << ' ' << n3.V << endl;}

#include<bits/stdc++.h>using namespace std;struct Node{    int M, V;    Node(int a, int b){        M = a;        V = b;    }    friend bool operator < (const Node n1, const Node n2){        return n1.V < n2.V;    }    friend bool operator > (const Node n1, const Node n2){        return n1.V > n2.V;    }    friend ostream &operator << (ostream &os, const Node n){        os << n.M << ' ' << n.V;        return os;    }};int main(){    Node n1(1, 65), n2(5, 23), n3(2, 99);    if(n1 < n2) cout << n1 << endl;    else cout << n2 << endl;}

#include<bits/stdc++.h>using namespace std;struct Node{    int M, V;    Node(int a, int b){        M = a;        V = b;    }    friend bool operator < (const Node n1, const Node n2){        return n1.V < n2.V;    }    friend bool operator > (const Node n1, const Node n2){        return n1.V > n2.V;    }    friend ostream &operator << (ostream &os, const Node n){        os << n.M << ' ' << n.V;        return os;    }};int main(){    Node n1(1, 65), n2(5, 23), n3(2, 99);    priority_queue<Node> pq;    pq.push(n1), pq.push(n2), pq.push(n3);    while(!pq.empty()){        Node n = pq.top();        pq.pop();        cout << n << endl;    }}

阅读全文

0 0