#include "friend.h" #include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = numeric_limits<int>::max() / 2; // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int ans=0; for (int i=0;i<n;++i){ ans+=confidence[i]; } return ans; }