【CodeForces 351A】Jeff and Rounding（思维）



A. Jeff and Rounding

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Jeff got 2n real numbers a₁, a₂, ..., a_2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:

• choose indexes i and j (i ≠ j) that haven't been chosen yet;
• round element a_i to the nearest integer that isn't more than a_i (assign to a_i: ⌊ a_i ⌋);
• round element a_j to the nearest integer that isn't less than a_j (assign to a_j: ⌈ a_j ⌉).

Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.

Input

The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a₁, a₂, ..., a_2n (0 ≤ a_i ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.

Output

In a single line print a single real number — the required difference with exactly three digits after the decimal point.

Examples

input

3
0.000 0.500 0.750 1.000 2.000 3.000

output

0.250

input

3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896

output

0.279

Note

In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.

题目大意：2n个数，n个上取整，n个下取整，求如何选择使变换后数的和与原数和的差最小

思路：开始想着将小数部分排序，前n个下取整，后n个上取整，显然不对啊。后来又想使相邻的两个一个上取，一个下取，显然更不对。其实写出数学表达式就能看出来了，设小数部分为x，则下取整 sum+x， 上取整 sum - （1-x），合起来就是 x-（1-x）=x+x-1，也就是先把小数部分都加起来，然后讨论1的个数。起始时1有n个，但如果有一个数的小数部分为0，那么就能少一个1，用小数部分为0 的数的个数来松弛，找到最小值

#include <bits/stdc++.h>
#define manx 4002
#define INF 0x3f3f3f3f
using namespace std;
int n;
struct node
{
    double v,k;
}a[manx];
int main()
{
    double sum=0;
    int cot=0;
    scanf("%d",&n);
    for (int i=0; i<2*n; i++){
        scanf("%lf",&a[i].v);
        a[i].k = a[i].v - (int)a[i].v;
        if(!a[i].k) cot++;
        sum+=a[i].k;
    }
    double ans=INF;
    if(sum >= n) ans=sum-n;
    else{
        for(int i=0; i<=cot && i<=n; i++){ //0 num
            ans=min(fabs(ans),fabs(sum-(n-i)));
        }
    }
    printf("%.3f\n",fabs(ans));
    return 0;
}