2 solutions

  • 0
    @ 2026-9-21 20:36:58
    #include<bits/stdc++.h>
    using namespace std;
    int a[11110];
    int main()
    {
        int n,sum=0,maxv=0,k;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++)
            {
                sum=a[i]-a[j];
                if(sum<=k)
                {
                    sum=0;
                    for(int x=j;x<=i;x++)
                    {
                        sum+=a[x];
                    }
                    maxv=max(maxv,sum);
                }
            }
        }
        cout<<maxv;
        return 0;
    }
    
    
    • 0
      @ 2026-2-6 9:39:04
      #include<bits/stdc++.h>
      using namespace std;
      int a[11110];
      int main()
      {
          int n,sum=0,maxv=0,k;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++)
              {
                  sum=a[i]-a[j];
                  if(sum<=k)
                  {
                      sum=0;
                      for(int x=j;x<=i;x++)
                      {
                          sum+=a[x];
                      }
                      maxv=max(maxv,sum);
                  }
              }
          }
          cout<<maxv;
          return 0;
      }
      
      • 1

      Information

      ID
      2184
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      7
      Tags
      # Submissions
      27
      Accepted
      7
      Uploaded By