7 4
3 7 5 3

What is correct algorithm?

My program that find 2 mins and print Math.Max(min1 + min2 - n, 0) don't pass test 13.

Can you please explain what this problem is asking?

Input:
10 2
8 8
Output:
6

Input:
10 3
8 8 8
Output:
4

Can you explain how the output is changing? What's the logic/intuition behind this? Please explain in details.

(yes, somehow I've got wa15)
try this test (it helped me to get AC):
10 3
7 7 7

Input:
10 3
9 9 9

Output:
7

            long min = n;
            for (int i = 0; i < k; i++)
                for (int j = i + 1; j < k; j++) {
                    long diff = (data[i] + data[j] - n);
                    if (diff < min)
                        min = diff;
                }
            Console.WriteLine(min < 0 ? 0 : min);

Just use __int64 instead of long long. That helped me.

var a,i,b,n,k: int64;
begin
readln(n,k);
for i:=1 to k do
 begin
  read(a);
  b:=b+a;
 end;
writeln(b-n);
end.

Here is my code. What is wrong? Help, please!

var m,n:int64;
k,i:0..20;
a:array[1..20] of int64;

begin
  read(n,k);
  for i:=1 to k do
  read(a[i]);
  for i:=2 to k do
  if a[i]<a[i-1] then
  begin
      m:=a[i];
      a[i]:=a[i-1];
      a[i-1]:=m
  end;
  m:=n-(n-a[1])-(n-a[2]);
  if m<=0 then write(0) else write(m);
end.

Edited by author 02.11.2013 04:21

            var min1 = n;
            var min2 = n;

            for (var i = 0; i < k; i++)
            {
                var a = vals[i];
                if (a < min1)
                {
                    min2 = min1;
                    min1 = a;
                }
                else if (a < min2)
                    min2 = a;
            }

            Console.WriteLine(Math.Max(min1 + min2 - n, 0));

Does everyone speak at least one dialect?

Why?

---
My fault

Edited by author 29.06.2013 02:09

var a: int64;
n:int64;   sum:int64; i,k:integer;
begin
read(n,k);
a:=0;
sum:=0;
for i:=1 to k do begin read(a); sum:=sum+a;  end;
if sum-n >=0 then
write(sum - n) else write('0');
end.

Edited by author 03.01.2015 03:26

Edited by author 03.01.2015 03:27

Is it guaranteed that a1+a2+...+ak >= n?

so what is the trick with the test 13? Here is my code:

public static void main(String[] args) {
            Scanner input = new Scanner(System.in);
            int n = input.nextInt();
            int k = input.nextInt();
            long[] arr = new long[k];
            long first = 20000000000000L;
            int first_location = 0;
            long second = 2000000000000L;
            for (int i = 0; i < k; i++)
                arr[i] = input.nextInt();

            for (int i = 0; i < k; i++)
                if (arr[i] < first)
                {
                    first = arr[i];
                    first_location = i;
                }
            arr[first_location] = 0;

            for (int i = 0; i < k; i++)
                if (arr[i] < second && arr[i] != 0)
                    second = arr[i];
            long answer = first + second - n;
            if (answer > 0)
                System.out.println(answer);
            else System.out.println(0);

    }

Please, give me a more test with answer.

-

Edited by author 05.07.2014 22:48

import java.util.*;

public class Test_1874 {

    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner s = new Scanner(System.in);
        int n, k, m;

        n = s.nextInt();
        k = s.nextInt();

        long[] a = new long[k];
        for (int i = 0; i < k; i++) {
            a[i] = s.nextInt();
        }
        for (int i = 1; i < k; i++) {
            if (a[i] < a[i - 1]) {
                m = (int) a[i];
                a[i] = a[i - 1];
                a[i - 1] = m;
            }
        }
        m = (int) (n - (n - a[0]) - (n - a[1]));
        if (m <= 0) {
            System.out.println("0");
        } else {
            System.out.println(m);
        }
    }
}

广东话不好学咩？

TL1 with G++ but AC 0.015 with VC++ 2010? My solution is only 14 strings and only one cycle to read ai.