A - Stones I (暴力枚举)

最新推荐文章于 2023-02-25 23:03:36 发布

_pkm_

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量530

点赞数

分类专栏：模拟排序

本文链接：https://blog.csdn.net/u013167299/article/details/44923099

版权

模拟同时被 2 个专栏收录

54 篇文章 0 订阅

订阅专栏

排序

10 篇文章 0 订阅

订阅专栏

A - Stones I
Time Limit: 1000MS Memory Limit: 65536KB
Total Submit: 510 Accepted: 97 Special Judge: No
Description

Xiaoming took the flight MH370 on March 8, 2014 to China to take the ACM contest in WHU. Unfortunately, when the airplane crossing the ocean, a beam of mystical light suddenly lit up the sky and all the passengers with the airplane were transferred to another desert planet.

When waking up, Xiaoming found himself lying on a planet with many precious stones. He found that:

There are n precious stones lying on the planet, each of them has 2 positive values ai and bi. Each time Xiaoming can take the ith of the stones ,after that, all of the stones’ aj (including the stones Xiaoming has taken) will cut down bi units.

Xiaoming could choose arbitrary number (zero is permitted) of the stones in any order. Thus, he wanted to maximize the sum of all the stones he has been chosen. Please help him.
Input
The input consists of one or more test cases.

First line of each test case consists of one integer n with 1 <= n <= 1000.
Then each of the following n lines contains two values ai and bi.( 1<= ai<=1000, 1<= bi<=1000)
Input is terminated by a value of zero (0) for n.
Output
For each test case, output the maximum of the sum in one line.
Sample Input
1
100 100
3
2 1
3 1
4 1
0
Sample Output
0

ans=max∑(ai-k*bi) 0=<k<=n

//#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
const int maxn=100011;
const int inf=999999999;
#define lson (rt<<1),L,M
#define rson (rt<<1|1),M+1,R
#define M ((L+R)>>1)
#define For(i,n) for(int i=0;i<(n);i++)
template<class T>inline T read(T&x)
{
    char c;
    while((c=getchar())<=32);
    bool ok=false;
    if(c=='-')ok=true,c=getchar();
    for(x=0; c>32; c=getchar())
        x=x*10+c-'0';
    if(ok)x=-x;
    return x;
}
template<class T> inline void read_(T&x,T&y)
{
    read(x);
    read(y);
}
template<class T> inline void read__(T&x,T&y,T&z)
{
    read(x);
    read(y);
    read(z);
}
template<class T> inline void write(T x)
{
    if(x<0)putchar('-'),x=-x;
    if(x<10)putchar(x+'0');
    else write(x/10),putchar(x%10+'0');
}
template<class T>inline void writeln(T x)
{
    write(x);
    putchar('\n');
}
//-------IO template------
typedef long long  LL;
struct node
{
    int ai,bi;
}p[maxn];
int cnt=0;
bool cmp(node a,node b)
{
    return (a.ai-a.bi*cnt)>(b.ai-b.bi*cnt);
}
int main()
{
    int n,m,i,j,k,t;
    while(read(n))
    {
        For(i,n)read_(p[i].ai,p[i].bi);
        int ans=0;
        int tmp=0;
        for(cnt=1;cnt<=n;cnt++)
        {
            sort(p,p+n,cmp);
            For(j,cnt)
            {
                tmp+=p[j].ai-p[j].bi*cnt;
            }
            ans=max(ans,tmp);
            tmp=0;
        }
        writeln(ans);
    }
    return 0;
}