#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = int;
// Find out best sample
int findSample(int n, int confidence[], int host[], int protocol[]) {
ll maxConfidence = 0;
for (ll i = 0; i < n; i++) {
maxConfidence = max(maxConfidence, confidence[i]);
}
return maxConfidence;
}
// const ll MAX_N = 1e5;
// int confidence[MAX_N];
// int host[MAX_N];
// int protocol[MAX_N];
// int main() {
// ll N;
// cin >> N;
// for (ll i = 0; i < N; i++) cin >> confidence[i];
// for (ll i = 1; i < N; i++) {
// cin >> host[i] >> protocol[i];
// }
// ll res = findSample(N, confidence, host, protocol);
// cout << "Output: " << res << endl;
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |