제출 #1278860

#제출 시각아이디문제언어결과실행 시간메모리
1278860stanwaibbangeFriend (IOI14_friend)C++20
8 / 100
2 ms580 KiB
#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;
	int ans=0;
	for (int i=0;i<n;++i){
		if (confidence[i] > ans) {
			ans = confidence[i];
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...