pair

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <iterator>
#include <vector>
#include <stack>

#define maxn 10000005
typedef int Int;
typedef long long ll;
using namespace std;

int main(){
	pair<int,int> p(1,2);
	cout<<p.first<<" "<<p.second<<endl;
	
	vector<pair<int,int> > v;
	v.push_back(pair<int,int>(1,100));
	cout<<v[0].first<<endl;
	
	queue<pair<int,int> > q;
	q.push({1,100}) ;
	//q.emplace(1,100);	C11
	cout<<q.front().first<<endl;

	return 0;
}