40 lines
836 B
C++
40 lines
836 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
using namespace std;
|
||
|
|
int n;
|
||
|
|
const int N = 1010;
|
||
|
|
int a[N];
|
||
|
|
int b[N];
|
||
|
|
int k;
|
||
|
|
int main() {
|
||
|
|
cin >> n;
|
||
|
|
cin >> k;
|
||
|
|
for (int i = 1; i <= n;i++){
|
||
|
|
cin >> a[i];
|
||
|
|
}
|
||
|
|
sort(a + 1, a + 1 + n);
|
||
|
|
for (int i = 1; i <= n;i++){
|
||
|
|
b[n - i + 1] = a[i];
|
||
|
|
}
|
||
|
|
// for (int i = 1; i <= n; i++) cout << b[i] << " ";
|
||
|
|
|
||
|
|
int mx, mi;
|
||
|
|
int cnt = 0;
|
||
|
|
int ans = 0;
|
||
|
|
for (int i = 1; i <= n;i++){
|
||
|
|
mx = b[i];
|
||
|
|
cnt += mx;
|
||
|
|
for (int j = i + 1; j <= n;j++){
|
||
|
|
mi = b[j];
|
||
|
|
if(mx-mi<=k){
|
||
|
|
cnt += mi;
|
||
|
|
// cout <<"cnt="<< cnt << " ";
|
||
|
|
}
|
||
|
|
else
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
ans = max(ans, cnt);
|
||
|
|
cnt = 0;
|
||
|
|
}
|
||
|
|
cout << ans << endl;
|
||
|
|
return 0;
|
||
|
|
}
|