Thanks:)

I have correct answer at all tests, but i got WA #4

I have correct answer at all tests, but i got WA #5... Can anyone help me?

Thanks!I find my mistake in last test.

Thank you very much!

yes

try this:
8
6 7 9 13 18 24 31 50

expected: 0

My program do this

#include <iostream>

int main()
{
    int temp = 0,  maxtemp=0, even = 0, midle = 0, different = 0, maxdifferent = 0;
    int arrayA[100];
    int sizeArray;
    std::cin >> sizeArray;
 for (int i = 0; i < sizeArray; i++)
 {
     std::cin >> arrayA[i];
 }
 for (int i = 0; i < sizeArray; i++)
    {
       for (int j = i; j < sizeArray; j++)
        {
            if (arrayA[i] < arrayA[j])
            {
                temp = arrayA[i];
                arrayA[i] = arrayA[j];
                arrayA[j] = temp;
            };

        };
    };
        for (int i = 0; i < sizeArray; i++)
        {
            midle += arrayA[i];
        };
        even = midle % 2;
        maxdifferent= different= midle = midle / 2 +even;
        if (sizeArray != 1)
         {
            for (int i = 0; i < sizeArray; i++)
            {
                different = midle;
                for (int j = i; j < sizeArray; j++)
                {
                    if (different >= arrayA[j])
                    {
                        temp += arrayA[j];
                        different -= arrayA[j];
                    };

                };
              if (maxdifferent > different)
                     {
                         maxdifferent = different;
                     };
            };
        };
        maxdifferent = 2* maxdifferent -even;
    std::cout << maxdifferent;
}

thank you very much,, I've been stuck in this problem for weeks because of this.

THANKS!!!

I had. You must add in your programm something like this:

 if(sum/9>2*n){
  printf("0");
  return 0;
 }

Thanks for this testset, helped me find the bug :)

The same, in a more reusable format:

18
1000000000
999999000
999000999
405
101
1001
10001
100001
1000001
10000001
100000001
555555555
191919191
838383838
123456789
987654321
987654319
101010101

71 999999929
19 999998981
3 5 999000991
3 5 397
101
3 7 991
3 31 9967
3 7 99991
3 19 999979
3 7 9999991
3 67 99999931
3 11 555555541
3 61 191919127
59 838383779
3 29 123456757
2 987654319
987654319
3 19 101010079

How to solve problem without long arithmetics?

The main idea of this test following in sorting relative fees instead of absolute fees.

Simple example:
2 1
10 10 1 1
999990 1
100 1

The first package has huge absolute value of fees ((999999 - 10) * 1), but it adds only 9 credits to the initial fees.

Edited by author 18.06.2022 20:06

You only need to write about 3 lines of python code to solve this.

try:
  help(str.split)
  help(reversed)
  help(str.join)

Thank you!

But how to prove that we can make such competition where k is the smallest value and we have (n - 1) values that are not less?

Edited by author 08.06.2022 21:21