H Kuangyeye and hamburgers

时间：2019-01-06 19:11:52 阅读：222 评论：0 收藏：0 [点我收藏+]

链接：https://ac.nowcoder.com/acm/contest/338/H
来源：牛客网

题目描述

Kuangyeye is a dalao of the ACM school team of Hunan University. His favorite food are hamburgers. One day, Kuangyeye came to the KFC(or maybe McDonald) and saw n hamburgers on the counter.The weight of the i-th hamburger was w_i. Since he likes hamburgers very much, he would like to buy some hamburgers. Considering his weight or other factors, Kuangyeye only wanted to eat all the hamburgers from the a-th heaviest to the b-th. Since Kuangyeye is fickle, he had k plans before buying hamburgers. The i-th plan gives a_i and b_i. Please help Kuangyeye calculate the maximum weight of hamburgers he can eat among the k plans.

输入描述:

the first line of input contains two integer n and k--the number of hamburgers on the counter and the number of plans Kuangyeye had;
the next line contains n integer--the i-th integer represents the weight of i-th hamburger,namely w

;
Each the following k line contains two integer a

 and b

 ,represents Kuangyeye‘s strategy in his i-th plan.

输出描述:

Output contain a single integer,represents maximum weight of hamburgers Kuangyeye can eat.

示例1

输入

复制

输出

复制

说明

Kuangyeye‘s first plan was to eat the hamburger weighing 6；

and his second plan was to eat the hamburger weighing 3 and 4;

So the maximum weight of hamburgers he can eat was 7.

备注:

1≤n,k≤100000,1≤a

≤b

≤n,1≤w

≤10000

题解：排序，计算前缀和，模拟

#include <iostream>
#include <algorithm>
using namespace std;
int w[100050];
long long dp[100050];
 
bool cmp(const int& a,const int& b) {
    return a>b;
}
 
int main() {
    int n,k;
    long long ans=0;
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>w[i];
    sort(w+1,w+n+1,cmp);
    dp[0]=0;
    for(int i=1;i<=n;i++) {
        dp[i]=dp[i-1]+w[i];
    }
    while(k--) {
        int l,r;
        cin>>l>>r;
        ans=max(dp[r]-dp[l-1],ans);
    }
    cout<<ans<<endl;
    return 0;
}

H Kuangyeye and hamburgers

原文：https://www.cnblogs.com/DWVictor/p/10229893.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)