GCJ 2008 Round1A Problem A. Minimum Scalar Product
来源:互联网 发布:魔兽地图优化精灵 编辑:程序博客网 时间:2024/04/30 11:55
Problem A. Minimum Scalar Product
This contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guide to get started.
Small input
5 points
Solve A-small
Large input
10 points
You are given two vectors v1=(x1,x2,...,xn) and v2=(y1,y2,...,yn). The scalar product of these vectors is a single number, calculated as x1y1+x2y2+...+xnyn.
Suppose you are allowed to permute the coordinates of each vector as you wish. Choose two permutations such that the scalar product of your two new vectors is the smallest possible, and output that minimum scalar product.
Input
For each test case, output a line
Case #X: Y
where X is the test case number, starting from 1, and Y is the minimum scalar product of all permutations of the two given vectors.
Limits
Small dataset
T = 1000
1 ¡Ü n ¡Ü 8
-1000 ¡Ü xi, yi ¡Ü 1000
Large dataset
T = 10
100 ¡Ü n ¡Ü 800
-100000 ¡Ü xi, yi ¡Ü 100000
Sample
Input
2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1
Output
Case #1: -25
Case #2: 6
This contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guide to get started.
Small input
5 points
Solve A-small
Large input
10 points
Solve A-large
You are given two vectors v1=(x1,x2,...,xn) and v2=(y1,y2,...,yn). The scalar product of these vectors is a single number, calculated as x1y1+x2y2+...+xnyn.
Suppose you are allowed to permute the coordinates of each vector as you wish. Choose two permutations such that the scalar product of your two new vectors is the smallest possible, and output that minimum scalar product.
Input
The first line of the input file contains integer number T - the number of test cases. For each test case, the first line contains integer number n. The next two lines contain n integers each, giving the coordinates of v1 and v2 respectively.
For each test case, output a line
Case #X: Y
where X is the test case number, starting from 1, and Y is the minimum scalar product of all permutations of the two given vectors.
Limits
Small dataset
T = 1000
1 ¡Ü n ¡Ü 8
-1000 ¡Ü xi, yi ¡Ü 1000
Large dataset
T = 10
100 ¡Ü n ¡Ü 800
-100000 ¡Ü xi, yi ¡Ü 100000
Sample
Input
2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1
Output
Case #1: -25
Case #2: 6
题意就是两行对应相乘的和的最小值
#include <cstdio>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 1000 + 10;int t;int n;int v1[maxn], v2[maxn];int main(){ scanf("%d", &t); for (int cas = 1; cas <= t; cas++){ scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &v1[i]); for (int i = 0; i < n; i++) scanf("%d", &v2[i]); sort(v1, v1 + n); sort(v2, v2 + n); ll ans = 0; for (int i = 0; i < n; i++) ans += (ll)v1[i] * v2[n - i - 1]; printf("Case #%d: %lld\n", cas, ans); } return 0;}
0 0
- GCJ 2008 Round1A Problem A. Minimum Scalar Product
- GCJ 2008 Round1A A Minimum Scalar Product
- Minimum Scalar Product(GCJ 2008 Round1A A)数学问题+贪心
- Minimum Scalar Product(2008 Round1A A)
- GCJ Round 1A 2008 Problem A. Minimum Scalar Product
- GCJ Round 1A 2008 Problem A. Minimum Scalar Product
- Code Jam 2008 Round1A Problem A. Minimum Scalar Product —— 贪心
- GCJ Round 1A 2008 Problem A. Minimum Scalar Product(YY)
- GCJ 2008 Round 1A A - Minimum Scalar Product (贪心)
- GCJ 2008 Round 1A Minimum Scalar Product
- 125_minimum scalar product (2008 round1A A)
- (code jam)Problem A. Minimum Scalar Product
- Code jam Problem A. Minimum Scalar Product
- GCJ--Minimum Scalar Product (2008 Round 1AA)
- Google code jam: Problem A. Minimum Scalar Product
- 2008 Round1AA Minimum Scalar Product
- Minimum Scalar Product
- Minimum Scalar product
- .NET实验6-4
- VS编译gtest和gmock, 讲解并使用
- numpy.mean() 计算矩阵均值
- leetcode---Binary Tree Level Order Traversal
- LeetCode-129.Sum Root to Leaf Numbers
- GCJ 2008 Round1A Problem A. Minimum Scalar Product
- Android UI设计之RecyclerView
- SpringMVC源码剖析(三)- DispatcherServlet的初始化流程
- 将流信息转化成字符串并解决乱码的问题
- 蓝桥杯初赛第三题
- [2627]:Life
- eclipse安装JBoss Tools插件
- hihocoder 1289 微软2016校园招聘4月在线笔试-2:403 Forbidden
- matlab中cell2mat函数不能生成矩阵的问题