Codeforces Round #443 (Div. 2), problem: (E) Tournament Solution In C/C++

By |2017-11-08T09:27:59+00:00November 8th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx[15],minn[15],sz; node() { int x;sz = 1; for(int i = 1; i <= k ; i ++) { scanf("%d",&x); minn[i] = maxx[i] = x; } } bool operator<(const node &nd)const { [...]