Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market

最新推荐文章于 2022-07-13 02:01:45 发布

twh233

最新推荐文章于 2022-07-13 02:01:45 发布

阅读量291

点赞数

分类专栏：二分法

本文链接：https://blog.csdn.net/qq_36553623/article/details/72852066

版权

二分法专栏收录该内容

19 篇文章 0 订阅

订阅专栏

传送门

On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules. It contains n different items numbered from 1 to n. The i-th item has base cost ai Egyptian pounds. If Sagheer buys kitems with indices x1, x2, ..., xk, then the cost of item xj is axj + xj·k for 1 ≤ j ≤ k. In other words, the cost of an item is equal to its base cost in addition to its index multiplied by the factor k.

Sagheer wants to buy as many souvenirs as possible without paying more than S Egyptian pounds. Note that he cannot buy a souvenir more than once. If there are many ways to maximize the number of souvenirs, he will choose the way that will minimize the total cost. Can you help him with this task?

Input

The first line contains two integers n and S (1 ≤ n ≤ 105 and 1 ≤ S ≤ 109) — the number of souvenirs in the market and Sagheer's budget.

The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 105) — the base costs of the souvenirs.

Output

On a single line, print two integers k, T — the maximum number of souvenirs Sagheer can buy and the minimum total cost to buy these ksouvenirs.

Note

In the first example, he cannot take the three items because they will cost him [5, 9, 14] with total cost 28. If he decides to take only two items, then the costs will be [4, 7, 11]. So he can afford the first and second items.

In the second example, he can buy all items as they will cost him [5, 10, 17, 22].

In the third example, there is only one souvenir in the market which will cost him 8 pounds, so he cannot buy it.

题意：有S的预支。n个商品。问能买几件商品。输出能买几件商品，并输出最少花费的钱。花费的钱除了商品的价格还要加上x(代表能买几件商品)*i(下标)

#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;


#define pi acos(-1)
#define endl '\n'
#define me(x) memset(x,0,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0);
#define rand() srand(time(0));
typedef long long LL;
typedef pair<int, int> pii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,1,0,0,-1,-1,1,1};
const int dy[]={0,0,1,-1,1,-1,1,-1};
const int maxn=1e3+5;
const int maxx=1e5+100;
const double EPS=1e-9;
const int MOD=1000000007;
#define mod(x) ((x)%MOD);
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
//typedef tree<pt,null_type,less< pt >,rb_tree_tag,tree_order_statistics_node_update> rbtree;
/*lch[root] = build(L1,p-1,L2+1,L2+cnt);
    rch[root] = build(p+1,R1,L2+cnt+1,R2);中前*/
/*lch[root] = build(L1,p-1,L2,L2+cnt-1);
    rch[root] = build(p+1,R1,L2+cnt,R2-1);中后*/
long long gcd(long long a , long long b){if(b==0) return a;a%=b;return gcd(b,a);}



inline int Scan()
{
    int res=0,ch,flag=0;
    if((ch=getchar())=='-')flag=1;
    else if(ch>='0' && ch<='9')res=ch-'0';
    while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-'0';
    return flag ? -res : res;
}
LL n,s;
LL a[maxx],b[maxx],cnt,sum;
int check(int x)
{
    cnt=0;
    for(int i=1;i<=n;i++)
        b[i]=a[i]+1LL*x*i;//每次处理一下b数组 
    sort(b+1,b+n+1);//排序
    for(int i=1;i<=x;i++)
        cnt+=b[i];//取前面x个
    //cout<<cnt<<endl;
    if(cnt<=s)
        return 1;
    else return 0;
}

int main()
{
    cin>>n>>s;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    int l=0,r=n;
    while(l<=r)//二分能买的商品个数
    {
        int mid=(l+r)>>1;
        if(check(mid))
        {
            l=mid+1;
            sum=cnt;
        }
        else r=mid-1;
    }
    cout<<(l-1)<<" "<<sum<<endl;
}