#include <stdio.h> #include <math.h> #include <string.h> #include <limits.h> #include <stdlib.h> #include <algorithm> #include <iostream> #include <utility> #include <vector> #include <string> #include <unordered_map> #include <map> #include <queue> #include <set> #include <stack> using namespace std; #define long long long #define fi first #define se second typedef pair<int,int> ii; int n; int A[100003], T[100003], H[100003]; bool task2 = 1; int solve_task2() { int sum = 0; for(int i = 0; i < n; i++) sum += A[i]; return sum; } // Find out best sample int findSample(int N,int confidence[],int host[],int protocol[]) { n = N; for(int i = 0; i < n; i++) A[i] = confidence[i]; for(int i = 1; i < n; i++) { T[i] = protocol[i], H[i] = host[i]; if(T[i] != 1) task2 = 0; } return solve_task2(); }