这尼玛有点问题啊
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; long long n,m,s; long long a1[1000001]; long long b1[1000001]; long long tot,ans,tr,ty,anss; bool cmp(long long x,long long y) { return x>y; } int main() { cin>>n>>m; for(int i=1;i<=n;i++)cin>>a1[i]; for(int i=1;i<=m;i++)cin>>b1[i]; sort(a1+1,a1+1+n,cmp); sort(b1+1,b1+1+m,cmp); for(int i=1;i<=m;i++) { if(a1[i]>=0)ans+=a1[i]*b1[i]; else ans+=a1[i]*b1[m-n+i]; } cout<<ans; }
过了!!???....
全部评论
(3) 回帖