#include <bits/stdc++.h> #include "friend.h" using namespace std; #define ll long long #define pi pair<int, int> #define f first #define s second #define pb push_back int findSample(int n, int* confidence, int* host, int* protocol){ if(protocol[1] == 1){ int sum = 0; for(int i = 0; i < n; i++){ sum += confidence[i]; } return sum; } else{ int mx = 0; for(int i = 0; i < n; i++){ mx = max(mx, confidence[i]); } return mx; } }