标签：des style blog http io color ar os java
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5985 Accepted Submission(s): 1682
讨论2个的情况：
a1 b1
a2 b2
如果这是最优的顺序，则满足：
a1 + a1*b2 + a2 <= a2 + a2*b1 + a1
等价于
a1/b1 < a2/b2
a1*b2 < a2*b1
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<stdlib.h> #include<algorithm> using namespace std; const int mod=365*24*60*60; const int MAXN=100000+5; struct node { __int64 ai,bi; bool operator<(const node &B)const { return ai*B.bi<B.ai*bi; } }a[MAXN]; int main() { int n; while(scanf("%d",&n)&&n) { __int64 ans=0; memset(a,0,sizeof(a)); for(int i=0;i<n;i++) scanf("%I64d %I64d",&a[i].ai,&a[i].bi); sort(a,a+n); for(int i=0;i<n;i++) { if(i==0) ans+=a[i].ai; else ans+=(a[i].ai+ans*a[i].bi); ans=ans%mod; } printf("%I64d\n",ans); } return 0; }
HDU 4442 Physical Examination (贪心+排序)
标签：des style blog http io color ar os java
原文地址：http://www.cnblogs.com/clliff/p/4085578.html
