#pragma GCC optimize("O3")
#include "friend.h"
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int findSample(int n,int c[],int host[],int pr[])
{
int i;
//for(i=0;i<n;i++)p[i].fr=c[i],p[i].sc=i;
//sort(p,p+n);
//reverse(p,p+n);
int s=0;
for(i=0;i<n;i++)s+=c[i];
sort(c,c+n);
if(pr[1]==2)return c[n-1];
return s;
}
/*int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
return 0;
}*/
