Codeforces Round #351 (VK Cup Round 3, Div. 2 Edition) B

#include <stdio.h>#include<algorithm>#include<vector>#include<string.h>using namespacestd;intMain () {intN,m,i;  while(SCANF ("%d%d", &n,&m)! =EOF) {Vector<int>Da,xi; intb; intMaxa=1, minb=N;  for(i=1; i<=m;i++) {scanf ("%d%d",&a,&b); if(a>b) {Maxa=Max (MAXA,B); MINB=min (minb,a); }              Else{Maxa=Max (maxa,a); MINB=min (minb,b); }          }           if(Minb<maxa) printf ("0\n"); Elseprintf"%d\n", minb-Maxa); }      return 0;}

351div2 B, one of the water problems, the title requirements: meet three conditions, the actual practice: find two groups of small and medium-sized group maximum and large group of the minimum value, the answer is the maximum value minus the minimum value!

Codeforces Round #351 (VK Cup Round 3, Div. 2 Edition) B