2 solutions
-
1
#include<bits/stdc++.h> using namespace std; int a[1110]; int main() { int n,k,s=0,ma=0; cin>>n>>k; for(int i=1;i<=n;i++) { cin>>a[i]; } sort(a+1,a+n+1); for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) { s=a[i]-a[j]; if(s<=k) { s=0; for(int k=j;k<=i;k++) { s+=a[k]; } ma=max(ma,s); } } } cout<<ma; return 0; }
Information
- ID
- 2183
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- # Submissions
- 21
- Accepted
- 7
- Uploaded By