infoarena

struct{int lev;
int eul;
};
vector<data> E;

E.lev.push_back(ceva);
E.eul.push_back(altceva);

struct s
{
   vector<int> lev; //lev este acum un vector  alocat dinamic 
   vector<int> eul; // la fel si eul
}E;
E.lev.push_back(ceva);
E.eul.push_back(altceva);

pair< vector< int >, vector< int > > E; //pair e declarat in utility
E.first.push_back(ceva);
E.second.push_back(altceva);

struct s {
    int lev, eul;
};
vector <s> V;

V.push_back((s){10, 100});

#include <cstdio>
#include <vector>

using namespace std;

struct nod
{
	int a, b;
	nod(){};
	nod(int _a, int _b) 
	{
		a = _a;
		b = _b;
	};
};

vector<nod> a;

int main()
{
	a.push_back(nod(10, 20));
	
	return 0;
}

#include <cstdio>
#include <vector>

using namespace std;

struct nod
{
	int a, b;
};

vector<nod> a;

int main()
{
	a.push_back((nod) (10, 20));

	return 0;
}

#include <cstdio>
#include <queue>

using namespace std;

struct nod
{
	int a, b;
	nod(){};
	nod(int _a, int _b) { a = _a; b = _b;}

	bool operator < (const nod &x)const
	// pt max-heap
	// daca vrei min-heap inversezi semnul
	{
		if(a < x.a) return 1;
		return 0;
	};
};


int main()
{
	priority_queue<nod> Q;
	Q.push(nod(2,3));
	Q.push(nod(4,1));
	printf("%d %d\n", Q.top().a, Q.top().b);
	return 0;
}

struct cmp
{
        bool operator()(const nod &a, const nod &b)const
        {
                  if(a.a < b.a) return 1;
                  return 0;
         }
};

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int,pair<int,int> > ii;
 priority_queue<ii,vector<ii>, greater<ii> > V;
int main()
{
    V.push(ii(1, pair<int,int> ( 2,3) ));
    cout<<V.top().first<<V.top().second.first<<V.top().second.second;

	return 0;
}