Sagheer and Nubian Market
来源:互联网 发布:淘宝网儿童冬季服装 编辑:程序博客网 时间:2024/06/08 00:16
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 containsn different items numbered from 1 to n. The i-th item has base cost ai Egyptian pounds. If Sagheer buysk items with indices x1, x2, ..., xk, then the cost of itemxj isaxj + xj·k for1 ≤ j ≤ k. In other words, the cost of an item is equal to its base cost in addition to its index multiplied by the factork.
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?
The first line contains two integers n andS (1 ≤ n ≤ 105 and1 ≤ S ≤ 109) — the number of souvenirs in the market and Sagheer's budget.
The second line contains n space-separated integersa1, a2, ..., an (1 ≤ ai ≤ 105) — the base costs of the souvenirs.
On a single line, print two integers k,T — the maximum number of souvenirs Sagheer can buy and the minimum total cost to buy thesek souvenirs.
3 112 3 5
2 11
4 1001 2 5 6
4 54
1 77
0 0
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 him8 pounds, so he cannot buy it.
题目大意:
#include<stdio.h>#include<string.h>#include<algorithm>#define ll long long intusing namespace std;int main(){ ll n,m; ll v[100005],dis[100005]; ll l,r,c,mid,sum,sum2; int i,j; while(scanf("%lld %lld",&n,&m)!=EOF) { sum=0; memset(dis,0,sizeof(dis)); for(i=1; i<=n; i++) scanf("%lld",&v[i]); l=0; r=n; while(l<=r) { sum=0; mid=(l+r)/2; for(i=1; i<=n; i++) { dis[i]=v[i]+mid*i;//每次更新单价 } sort(&dis[1],dis+n+1);//对物品进行价格从低到高排序 for(i=1; i<=mid; i++) sum+=dis[i];//算出总价 if(sum>m) r=mid-1;//为了找到一个合适的c不断进行二分 if(sum<=m) { sum2=sum; c=mid; l=mid+1; } } printf("%lld %lld\n",c,sum2); } return 0;}
- Sagheer and Nubian Market
- Sagheer and Nubian Market
- Sagheer and Nubian Market
- C. Sagheer and Nubian Market
- Codeforces812C Sagheer and Nubian Market
- Sagheer and Nubian Market(二分)
- Codeforces 812C-Sagheer and Nubian Market
- Codeforces 812 C Sagheer and Nubian Market
- Sagheer and Nubian Market (二分)
- Codeforces 812C Sagheer and Nubian Market
- codeforces 812C Sagheer and Nubian Market
- 二分+堆——Codeforces812C Sagheer and Nubian Market
- Codeforces 812C Sagheer and Nubian Market[二分]
- Codeforces 812C Sagheer and Nubian Market【二分】水题
- codeforces 812 C. Sagheer and Nubian Market(二分答案)
- Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market
- Codeforces Round #417 (Div. 2) C. Sagheer and Nubian Market
- 【Codeforces 812 C. Sagheer and Nubian Market】+ 二分
- 如何更快地找到行尾
- 第十二章 使用结构和指针
- Linux — 浅析环境变量
- 初学者---Android Fresco加载本地图片
- web容器,spring容器,MVC容器介绍
- Sagheer and Nubian Market
- stopPropagation() 和 preventDefault() 事件
- c++ 类静态变量 类常变量Mark
- linux mysql 报错ERROR 1820 (HY000): You must SET PASSWORD before executing this statement
- Android NDK 第一行代码
- SpringMVC是单例的,高并发情况下,如何保证性能的?
- 我的博客
- Centos7中openvpn搭建
- this*到底在哪里定义