Code: ```cpp class Solution { class DSU { public: DSU(int n):id(n), sz(n, 1) { std::ranges::iota(id, 0); } int find(int val) { int v = val; while(v != id[v]) { v = id[v]; } int next = id[val]; while(next != v) { next = id[val]; id[val] = v; val = next; } return v; } void unify(int val1, int val2) { int root1 = find(val1); int root2 = find(val2); if(root1 == root2) { return; } if(sz[root1] < sz[root2]) { sz[root2] += sz[root1]; id[root1] = root2; } else { sz[root1] += sz[root2]; id[root2] = root1; } } int size(int val) { return sz[id[val]]; } private: std::vector id; std::vector sz; }; public: int minMalwareSpread(vector>& graph, vector& initial) { int n = graph.size(); DSU dsu(n); for(int i = 0; i < n; ++i) { for(int j = 0; j < n; ++j) { if(i == j) continue; if(graph[i][j] == 1) { dsu.unify(i, j); } } } std::vector> freq(n, {0, INT_MAX}); for(int val : initial) { int root = dsu.find(val); freq[root].first++; freq[root].second = std::min(freq[root].second, val); } int min = INT_MAX; int toDelete = -1; int size = 0; for(int i = 0; i < n; ++i) { auto [malware, minIndex] = freq[i]; if(malware == 1) { min = 1; if(size < dsu.size(i)) { size = dsu.size(i); toDelete = minIndex; } else if(size == dsu.size(i)) { toDelete = std::min(minIndex, toDelete); } } } return min == 1 ? toDelete : *std::ranges::min_element(initial); } }; ```