Codeforces Round #426 (Div. 1), problem: (E) Caramel Clouds Solution In C/C++
#include <algorithm> #include <cstdio> #include <cstring> #include <map> #include <set> #include <utility> #include <vector> const int N = 300000; struct Sum { int add(int id, int value) { if (a.second == id) { a.first = …