Submission #1136474

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136474		Ak_16	Friend (IOI14_friend)	C++20	8 / 100	1 ms	328 KiB

friend

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int findSample(int n, int con[], int hos[], int pro[]){
  int mx=0;
  for(int i=0; i<n; i++){
    mx = max(mx, con[i]);
  }
  return mx;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31