n,s = map(int,input().split())
a = list(map(int,input().split()))
l = 1
r = n
c = 0
ans = 0
while l <= r:
mid = l+((r-l)//2)
lis = [0] * n
for i in range(n):
lis[i] = a[i] + ((i+1)*mid)
lis.sort()
s1 = sum(lis[:mid])
if s1 <= s:
c = mid
l = mid + 1
ans = s1
else:
r = mid - 1
print(f"{c} {ans}")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll can(int k,ll a[])
{
ll sum=0;
for(int i=0;i<k;i++)
sum+=a[i];
return sum;
}
int main() {
// ios::sync_with_stdio(0);
//cin.tie(0);
int n,s;
cin>>n>>s;
ll elements[n],a[n];
for(int i=0;i<n;i++)
cin>>elements[i];
ll l=0,h=n,mid,res=0,m=0;
while(l<=h)
{
mid=(l+h)/2;
for(int i=0;i<n;i++) a[i]= elements[i]+(i+1)*mid;
sort(a,a+n);
ll sum=can(mid,a);
if(sum<=s)
{
res=sum;
l=mid+1;
m=mid;
}
else h=mid-1;
}
cout<<m<<' '<<res;
return 0;
}429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |