重载问题

#include <bits/stdc++.h>
using namespace std;
/*
bool cmp1(int x,int y)
{
    return x<y;
}
struct Node
{
    int x,y;
}e[5];
bool cmp2(Node a,Node b){
    if(a.x!=b.x) return a.x<b.x;
}
*/
//int a[5];
struct Node{
    int x,y;
    Node(){}
    Node (int x,int y):x(x),y(y){}
    bool operator <(const Node &a) const{
        return x>a.x;
    }
    /*
    
    1 3
    2 2
    3 1

*/
};
int  main()
{
    /*
    for(int i =0;i<=3;i++){
        a[i] = 6-i;
    }
    sort(a,a+4,cmp1);
    for(int i =0;i<4;i++){
        printf("%d
",a[i]);
    }
    3
    4
    5
    6
*/
/*

for(int i =0;i<3;i++){
        scanf("%d%d",&e[i].x,&e[i].y);
    }
    sort(e,e+3,cmp2);
    for(int i =0;i<3;i++){
        printf("%d %d
",e[i].x,e[i].y);
    }
    3 6
    2 4
    1 0
    __________
    1 0
    2 4
    3 6
    
    */

#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#include  <map>

#include <utility>

#include <vector>

#include <queue>

using namespace std;

#define ll long long

#define P pair<ll,ll>

struct Node{

int x,y;

Node(){}

Node(int x,int y):x(x),y(y){}

bool operator < (const Node&a) const{

return  x<a.x;

}

}e[100];

int main()

{

/*

for(int i =0;i<3;i++){

e[i].x =i+1;

e[i].y=2*i;

}

sort(e,e+3);

for(int i =0;i<3;i++) printf("%d %d ",e[i].x,e[i].y);

1 0

2 2

3 4

*/

    priority_queue<Node>q;

    for(int i =0;i<3;i++){

        q.push(Node(3-i,i+1));

    }

    while(!q.empty()){

        Node u =q.top();

        q.pop();

        printf("%d %d ",u.x,u.y);

    }

/*

3 1

2 2

1 3

*/

return 0;

}