1037. Magic Coupon (25)
#include <iostream>
#include <vector>
#include <algorithm>using namespace std;int main()
{int nc;scanf("%d", &nc);int i;vector<long long> v[4];long long num;for(i = 1; i <= nc; i++){scanf("%lld", &num);if(num < 0){v[1].push_back(num);}else{v[0].push_back(num);}}int np;scanf("%d", &np);for(i = 1; i <= np; i++){scanf("%lld", &num);if(num < 0){v[3].push_back(num);}else{v[2].push_back(num);}}int size[4];for(i = 0; i <= 3; i++){size[i] = v[i].size();if(size[i] > 0){sort(v[i].begin(), v[i].end());}}int j;long long res = 0;for(i = size[0] - 1, j = size[2] - 1; i >= 0 && j >= 0; i--, j--){res += v[0][i] * v[2][j];}for(i = 0, j = 0; i <= size[1] - 1 && j <= size[3] - 1; i++, j++){res += v[1][i] * v[3][j];}printf("%lld\n", res);system("pause");return 0;
}
本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若转载，请注明出处：http://www.mzph.cn/news/974050.shtml
如若内容造成侵权/违法违规/事实不符，请联系多彩编程网进行投诉反馈email:809451989@qq.com，一经查实，立即删除！)
)
)
)
)
)
)
)
)
)
)
)
)