problem: (D) Arpa’s weak amphitheater and Mehrdad’s valuable Hoses Solution in C/C++ Archive

#include<stdio.h> int n, m, maxW, p, w, b, prev, next, gb,gw; int root(int i) { if(p!=i) p = root(p); return p; } int main() { scanf("%i%i%i",&n,&m,&maxW); for(int i=0;i<n;i++) scanf("%i",w+i); for(int i=0;i<n;i++) scanf("%i",b+i); int x, y; …