大根堆模板

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
//int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}

priority_queue<int>da; //大根堆
//priority_queue <int,vector<int>,greater<int> >q;  //小根堆

struct no{
	int a;
	no(int x = 0){
		a = x;
	}	
	bool operator < (const no &b)const{
		return a <b.a;                   //大根堆 
	}
};
priority_queue<no>q;
const ll inf = 0x3f3f3f3f;
const int mx = 0;
 
int main(){
	//	freopen("F:\\in.txt","r",stdin);
	//int T=10;	scanf("%d",&T);
	for(int i = 0; i < 10; i++){
		da.push(i);	
		q.push(no(i));
	}
	cout<<da.top()<<endl;
	cout<<q.top().a<<endl; 
	


	return 0;
}