20 февраля 2025
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
int[] arr = new int[N];
for (int i = 0; i < N; i++) {
arr[i] = sc.nextInt();
}
double avg= 0;
int sum = 0;
for (int i = 0; i < K; i++) {
sum += arr[i];
}
avg = (double) sum / K;
for (int i = K; i < N; i++) {
sum = sum - arr[i - K] + arr[i];
double cur = (double) sum / K;
if (cur > avg) {
avg = cur;
}
}
System.out.printf("%.2f\n", avg);
sc.close();
}
}
#BIRLASOFT
930 · public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
int x=sc.nextInt();
int[] arr=new int[n];
for(int i=0;i<n;i++) {
arr[i] = sc.nextInt();
}
System.out.println(Arrays.binarySearch(arr,x)>=0 ? (Arrays.binarySearch(arr,x)):-1);
}
}
#BIRLASOFT
978 ·