2019牛客多校第七场 C Governing sand

因为当时时间不怎么够就没写。。。

其实就是一个模拟题而已下面注释很清楚

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

时间限制：C/C++ 3秒，其他语言6秒
空间限制：C/C++ 65536K，其他语言131072K
64bit IO Format: %lld

题目描述

The Wow village is often hit by wind and sand,the sandstorm seriously hindered the economic development of the Wow village.

There is a forest in front of the Wowo village, this forest can prevent the invasion of wind and sand. But there is a rule that the number of tallest trees in the forest should be more than half of all trees, so that it can prevent the invasion of wind and sand. Cutting down a tree need to cost a certain amount of money. Different kinds of trees cost different amounts of money. Wow village is also poor.

There are n kinds of trees. The number of i-th kind of trees is PiP_iPi​, the height of i-th kind of trees is HiH_iHi​, the cost of cutting down one i-th kind of trees is CiC_iCi​.

 

(Note: "cutting down a tree" means removing the tree from the forest, you can not cut the tree into another height.)

 

输入描述:

The problem is multiple inputs (no more than 30 groups).
For each test case.
The first line contines one positive integers n(1≤n≤105)n (1 \leq n \leq 10^5)n(1≤n≤105),the kinds of trees.
Then followed n lines with each line three integers Hi(1≤Hi≤109)H_i (1 \leq H_i \leq 10^9)Hi​(1≤Hi​≤109)-the height of each tree, Ci(1≤Ci≤200)C_i (1 \leq C_i \leq 200)Ci​(1≤Ci​≤200)-the cost of cutting down each tree, and Pi(1≤Pi≤109)P_i(1 \leq P_i\leq 10^9)Pi​(1≤Pi​≤109)-the number of the tree.

输出描述:

For each test case, you should output the minimum cost.

示例1

输入

复制

2
5 1 1
1 10 1
2
5 1 2
3 2 3

输出

复制

1
2

 

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
#define pi acos(-1.0)
const ll mod=1e17+9;
const ll maxx=1e5+1005;
using namespace std;
struct stu
{
   ll h,v,num;
}a[maxx];
ll biaoji[300];
bool cmp(stu a,stu b)
{
    return a.h>b.h;
}
int main ()  
{  
    ll n,i,j;
    while(~scanf("%lld",&n))
	{
        mem(biaoji,0);
        ll sum=0;
        for(i=1;i<=n;i++)
		{
            scanf("%lld%lld%lld",&a[i].h,&a[i].v,&a[i].num);
            biaoji[a[i].v]+=a[i].num;// 这种价钱的一共有多少颗树. 
            sum+=a[i].num;
        } 
        sort(a+1,a+1+n,cmp);
        ll ans=mod,tmp=0;
        // ans代表这一高度一共有多少棵树。 
        for(i=1;i<=n;i++)
		{
            ll cnt=a[i].num;// 多少颗 
            biaoji[a[i].v]-= a[i].num;// 此价钱对应的减去多少颗 
            ll res=a[i].v*a[i].num;//  这一种数的全部价钱 
            sum-=a[i].num; // 减去这种数的种数 
            while(i<=n&&a[i].h==a[i+1].h)// 高度相等的不同种类的树。 
			{
                i++;
                cnt+=a[i].num;// 再加上这些同高度的 
                biaoji[a[i].v]-=a[i].num;// 减去。 
                res+=a[i].v*a[i].num;// 钱数 
                sum-=a[i].num;// 再减去这些树即为剩下还有多少树 
            }
            // 然后从剩下的树中从价值少的开始减去树，剪到符合题意为止。 
            // 当剩下树的个数sum==cnt（高度为h的所有树的和时）可以
            ll ans1=0,ans2=0;// 需要砍多少树 需要多少钱； 
			cnt--;
            for(j=1;j<=200;j++)
			{
                if(sum-ans1<=cnt) break;
                if(sum-ans1-biaoji[j]<=cnt)// 这一价值的树不需要全部砍完； 
				{
                    ans2+=j*(sum-ans1-cnt);
                    break;
                }
				else
				{
                    ans2+=j*biaoji[j];
                    ans1+=biaoji[j];
                }
            }
            ans=min(ans,ans2+tmp);
            tmp+=res;
        }
        printf("%lld\n",ans);
    }	
    return 0; 
}