0ptsRE求条玄关

#include<bits/stdc++.h>
#define ll long long
#define db double
#define endl '\n'
#define int register int
#define AKIOI ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
#define AKNOI return 0;
#define db double
using namespace std;
const ll MAXN=50005;
ll n,k,p,dia[MAXN],maxn=LLONG_MIN,res;
struct member{
	ll l,r,length;
}line[MAXN];
inline bool cmp(member p,member q){
	return p.length>q.length;
}
inline bool becovered(member p,member q){
	if(p.l>q.l) swap(p,q);
	if(p.r>q.r) return true;
	else return false;
}
signed main(){
	AKIOI;
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>dia[i];
	sort(dia+1,dia+n+1);
	for(int le=1;le<=n;le++){
		if(le>1&&dia[le]==dia[le-1]) continue;
		for(int ri=n;ri>=le;ri--){
			if(ri-le<=k) line[++p]=member{le,ri,ri-le+1};
		}
	}
	sort(line+1,line+p+1,cmp);
	for(int i=1;i<=p;i++){
		for(int j=i+1;j<=p;j++){
			if(becovered(line[i],line[j])){
				continue;
			}
			else{
				cout<<line[i].length+line[j].length;
				AKNOI;
			}
		}
	}
	AKNOI;
}