太乱了QAQ

#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
long long n,m,a[505],b[505],q[505],p,c[505],s,maxn=-1;
set<long long> x;
bool f;
int main(){
	cin>>n>>m;
	for (int i=1;i<=n;i++){
		cin>>a[i];
		x.insert(a[i]);
	}
	for (int i=1;i<=n;i++){
		cin>>b[i];
	}
	for (set<long long>::iterator i=x.begin();i!=x.end();i++){
		for (int j=1;j<=n;j++){
			if (a[j]!=*i) q[p++]=a[j],c[p]=a[j];
		}
		sort(q+1,q+1+p);f=0;
		for (int j=1;j<=p;j++){
			if (q[j]!=c[j]) f=1;
		}
		if (f==1) continue;
		else{
			s=0;
			for (int j=1;j<=m;j++){
				s+=q[j];
			}
			maxn=max(maxn,s);
		}
	}
	cout<<maxn;
	return 0;
}