#include using namespace std; template void vector_sort(vector& v,function fn=[](int a){return a;},int decided=0){ int range=v.size()-decided; if(range==0){ return; } int parent=(v.size()-decided-1)/2; int child=parent*2+1; int parent_depth=1; while(pow(2,parent_depth)-1=0){ for(int i=pow(2,parent_depth)-1;i tuple,vector> vector_runlength(vector v){ vector element={}; vector number={}; int consecutive=1; int n=v.size(); for(int i=1;i>N; vector X(N); for(int i=0;i>X[i]; } vector_sort(X); tuple,vector> A=vector_runlength(X); int m=10000000; for(int i=0;i(A)[i+1]-get<0>(A)[i]); } cout<