zoukankan      html  css  js  c++  java
  • hdu 4882 ZCC Loves Codefires(贪心)

    # include<stdio.h>
    # include <algorithm>
    # include <string.h>
    using namespace std;
    struct node
    {
        int v;
        int t;
    };
    struct node a[100010];
    bool cmp(node a,node b)
    {
        return  a.v *a.t+(a.v+b.v)*b.t<b.v*b.t+(a.v+b.v)*a.t;
    }
    int main()
    {
        int n;
        __int64 sum;
        int i;
        while(~scanf("%d",&n))
        {
            
            for(i=0;i<n;i++)
                scanf("%d",&a[i].v);
            for(i=0;i<n;i++)
                scanf("%d",&a[i].t);
            sort(a,a+n,cmp);
            __int64 sum1=0;
            sum=0;
            for(i=0;i<n;i++)
            {
                sum = (a[i].v+sum);
                sum1+=sum*a[i].t;
            }
            printf("%I64d
    ",sum1);
        }
        return 0;
    }

  • 相关阅读:
    学习日报
    阅读笔记2
    学习日报
    记账本开发7
    记账本开发6
    学习日报
    记账本开发5
    今日总结
    今日总结
    家庭记账本7
  • 原文地址:https://www.cnblogs.com/yutingliuyl/p/7074487.html
Copyright © 2011-2022 走看看