Submission #397977

#TimeUsernameProblemLanguageResultExecution timeMemory
397977prvocisloFriend (IOI14_friend)C++17
8 / 100
1 ms332 KiB
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;

int findSample(int n, int c[], int h[], int p[])
{
	return *max_element(c, c + n);
}
#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...