hdu 4882 ZCC Loves Codefires(贪心)
2014-07-24 19:34
555 查看
# 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\n",sum1); } return 0; }
相关文章推荐
- hdu 4882 ZCC Loves Codefires(贪心)
- HDU 4882 ZCC Loves Codefires (贪心)
- hdu 4882 ZCC Loves Codefires(数学题+贪心)
- HDU 4882 ZCC Loves Codefires (贪心)
- HDU 4882 ZCC Loves Codefires(贪心水)
- hdu 4882 ZCC Loves Codefires(贪心)
- HDU 4882 ZCC Loves Codefires(2014多校第二场1011)(贪心)
- HDU 4882 ZCC Loves Codefires(贪心)
- hdu 4882 ZCC Loves Codefires (贪心 推导)
- 2014多校第二场1011 || HDU 4882 ZCC Loves Codefires (贪心)
- hdu 4882 ZCC Loves Codefires(数学题+贪心)
- HDU 4882 ZCC Loves Codefires
- HDU 4882 ZCC Loves Codefires 还是利用率
- HDU 4882 ZCC Loves Codefires yy
- HDU 4882 ZCC Loves Codefires
- hdu 4882 ZCC Loves Codefires
- hdu 4882 ZCC Loves Codefires 2014年多校联合第二场
- hdoj 4882 ZCC Loves Codefires 【贪心】
- hdu4882-ZCC Loves Codefires(贪心)
- BZOJ 3850: ZCC Loves Codefires【贪心】