# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874020 | OSoverspike | Friend (IOI14_friend) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
int ans=0;
if (protocol[1]==1) {
for (int a=0; a<=n; a++) {
ans+=confidence[a];
}
} else {
for (int a=0; a<=n; a++) {
ans=max(ans, confidence[a]);
}
}
return ans;
}