제출 #416435

#제출 시각아이디문제언어결과실행 시간메모리
416435mjhmjh1104Friend (IOI14_friend)C++14
16 / 100
1 ms224 KiB
#include "friend.h"
#include <algorithm>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]) {
	int res = 0;
	for (int i = 0; i < n; i++) {
		if (protocol[1] == 1) res += confidence[i];
		else res = max(res, confidence[i]);
	}
	return res;
}
#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...