# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97264 | 2019-02-14T16:58:06 Z | MvC | Friend (IOI14_friend) | C++11 | 0 ms | 0 KB |
#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; ll 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); ll s=0; for(i=0;i<n;i++)s+=c[i]; sort(c,c+n); if(pr[0]==2)return c[n-1]; else 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; }*/