Submission #74940175
Source Code Expand
import java.util.*;
class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int L = sc.nextInt();
int[] d = new int[n];
for (int i = 0; i < n; i++) {
d[i] = sc.nextInt();
}
int bestSkill = -1;
int ans = -1;
for (int i = 0; i < n; i++) {
if (d[i] <= L) {
if (d[i] > bestSkill) {
bestSkill = d[i];
ans = i + 1; // 1-based index
}
}
}
System.out.println(ans);
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | A - Optimal Practice Partner |
| User | dkushal_17 |
| Language | Java24 (OpenJDK 24.0.2) |
| Score | 0 |
| Code Size | 659 Byte |
| Status | CE |