competition template

__template.cpp

/* c650Alpha __template.cpp */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define FI first
#define SE second

typedef long long ll;
typedef std::pair<ll,ll> pairll;

template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using MaxHeap = std::priority_queue<T, std::vector<T>, std::less<T>>;
template <class K, class V = __gnu_pbds::null_type>
using ordered_set = __gnu_pbds::tree<K, V, std::less<K>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
/* order_of_key(k), how many elements <k */
/* find_by_order(k), k'th element (from 0) */
/* both logn */

const static ll INF = 0x3f3f3f3f3f3f3f3f;

static inline void setio(void);

int main(void) {
	setio();

	ll n; std::cin >> n;

	// std::cerr << static_cast<double>(clock())/CLOCKS_PER_SEC << "\n";

	return 0;
}

static inline void setio(void) {
	std::ios::sync_with_stdio(false);std::cin.tie(nullptr);
	std::cout.precision(10); std::cout << std::fixed;
}
/*
	consider n=0
	is y a vowel?
*/