asdfawegcgasdf

include<bits/stdc++.h>

define ll long long

using namespace std;

int n ,k;
double a[300005];
double sum[300005];
bool check(double mid){
for(int i=1; i<=n; i++){
double value = a[i] - mid;
sum[i]= sum[i-1]+value;
}
double minVale= 1000001;
for(int i=k; i<=n; i++){
if(minVale > sum[i-k]){
minVale=sum[i-k];
}else if (minVale <= sum[i-k]){
return true;
}
}
return false;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
double lo =0.0, h=1000000.000000;
for(int i=1; i<=n; i++){
double t; cin>>t;
a[i]=t;

}

for(int step=1; step<=500; step++){
    double mid= (lo+h)/2.0;
    if(check(mid)){
        lo=mid;
    }else{
        h=mid;
    }
}
// cout<<"hello";
cout << std::fixed << std::setprecision(6) << lo;

}

a

Cười Khúc Khích

Vanh314

gfjhytc

include<bits/stdc++.h>

using namespace std;
long long n,dem,m,a[1000000],s[1000000];
int main()
{
cin>>n;
cin>>m;
dem=0;
memset(s,0,sizeof(s));
for(int i=1;i<=n;i++)
{cin>>a[i];
s[a[i]]++;}
for(int i=1;i<=m;i++)
if(s[i]!=0){
for(int j=i+1;j<=m;j++)
if(i+j<=m)
{if(s[i]>s[j])dem=dem+s[j];
else dem=dem+s[i];}
else break;}
for(int i=1;i<=m;i++)
{
if(s[i]=1) dem=dem+1;
if(s[i]>1) dem=dem+(s[i]*(s[i]-1))/2;
}
cout<<dem;

}

bin lê
i'm tula