Codeforces Round #443 (Div. 2), problem: (E) Tournament Solution In C/C++
#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx,minn,sz; node() { int x;sz = 1; for(int i = 1; i <= k ; i ++) { scanf(“%d”,&x); minn = maxx …