# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1207359 | wazj2024 | Traffic (IOI10_traffic) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
static int N,P[1000000],S[1000000],D[1000000];
int LocateCentre(int N, int P[], int S[], int D[]) {
int a = -1;
int m = INT_MAX;
for (int i = 0; i < N; ++i) {
int c = 0;
for (int j = 0; j < N; ++j) {
if (j != i) {
c = max(c, P[j]);
}
}
if (c < m) {
m = c;
a = i;
}
}
return a;
}
int main(){
int i;
scanf("%d",&N);
for (i=0;i<N;i++) scanf("%d",&P[i]);
for (i=0;i<N-1;i++) scanf("%d%d",&S[i],&D[i]);
int r = LocateCentre(N,P,S,D);
printf("%d\n",r);
return 0;
}