hdu6011 Lotus and Characters

最新推荐文章于 2018-08-10 11:25:02 发布

kyoma

最新推荐文章于 2018-08-10 11:25:02 发布

阅读量569

点赞数

分类专栏： ------------解题报告-------------

本文链接：https://blog.csdn.net/kyoma/article/details/54668389

版权

------------解题报告------------- 专栏收录该内容

208 篇文章 0 订阅

订阅专栏

Lotus and Characters

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 284 Accepted Submission(s): 102

Problem Description

Lotus has

n kinds of characters,each kind of characters has a value and a amount.She wants to construct a string using some of these characters.Define the value of a string is:its first character's value*1+its second character's value *2+...She wants to calculate the maximum value of string she can construct.
Since it's valid to construct an empty string,the answer is always

≥0 。

Input

First line is

T(0≤T≤1000) denoting the number of test cases.
For each test case,first line is an integer

n(1≤n≤26) ,followed by

n lines each containing 2 integers

vali,cnti(|vali|,cnti≤100) ,denoting the value and the amount of the ith character.

Output

For each test case.output one line containing a single integer,denoting the answer.

Sample Input

Sample Output

Source

BestCoder Round #91

为蛇么自己是个智障呢。。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 260010;
int p,n,ans,now;
int save[maxn];
bool compare(int a,int b){
    return a>b;
}
int main(){
    int t,i,j,a,b,tot;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        p = 0;
        for(i=1;i<=n;i++){
            scanf("%d%d",&a,&b);
            for(j=1;j<=b;j++){
                save[++p] = a;
            }
        }
        sort(save+1, save+1+p,compare);
        tot = p;
        int last;
        ans = 0;
        p = 0;
        while(1){
            last = ans;
            ans += save[++p];
            for(i=1;i<p;i++){
                ans += save[i];
            }
            if(ans<last){
                ans = last;
                break;
            }
            if(p==tot){
                break;
            }
        }
        printf("%d\n",ans);
    }
    
    return 0;
}