#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int n, half, votes, q[101];
    cin >> n;
    half = (n/2) + 1;
    for (int i=0; i < n;i++)
        cin >> q[i];

    sort(q,q+n);

    for (int i =0;i<half;i++)
        votes += (q[i]/2) + 1;


    cout << votes;
    return 0;
}

I do here according to the test case description. But I need some hint what actually wanted in this problem.

using System;
using System.Linq;
namespace e3
{
    class Program
    {
        public static void Main(string[] args)
        {
            int k=int.Parse(Console.ReadLine());
            int[] arr = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int temp;
            for (int i = 0; i < k - 1; i++) {
        for (int j = 0; j < k - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                // меняем элементы местами
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }

            int s=0;
            for (int i = 0; i < k/2+1; i++) {
                s=s+(arr[i]/2+1);
            }
            Console.WriteLine(s);

        }
    }
}

Sort the n teams and take the first (n/2 + 1) team's people (by people i mean, array[i]/2 + 1).

If you have problem understanding what i have just written or for better understanding, give this a go : https://ideone.com/vD6SAm

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
 int a;
 int n;
 cin >> n;
 vector<int> v;
 for (int i = 0; i < n; i++) {
  cin >> a;
  v.push_back(a);
 }
 n = 0;
 sort(v.rbegin(), v.rend());
 for (int i = v.size()-1; i > (v.size()-2) / 2; i--)
  n += (v[i]+1)/2;
 cout << n << endl;
}

You can use for test this numbers:

9
3 11 7 9 13 25 7 11 5

The answer is 18.


---
Hint: Use sort? Try to think about what you sort

Hello ,
Can someone please tell me why I am getting wrong answer for test case 5?
I have used straight forward approach.
```
#include <stdio.h>
  2
  3 int group_distribution[10001];
  4
  5 void insertion_sort( int * arr, int size) {
  6     int i , j, key;
  7     for ( i = 1; i < size; i ++ ) {
  8         key = arr[i];
  9         j = i - 1;
 10         while ( arr[j] > key && j >= 0 ) {
 11             arr[j + 1] = arr[ j ];
 12             j = j - 1;
 13         }
 14         arr[ j + 1 ] = key;
 15     }
 16 }
 17
 18 int main( int argc, char **argv) {
 19     int k, ans = 0, i ;
 20     scanf("%d",&k);
 21     for ( i = 0; i < k ; i ++)
 22         scanf("%d",&group_distribution[i]);
 23     insertion_sort(group_distribution, k);
 24     for ( i = 0; i < (k+1)/2 ; i++ ) {
 25         ans += (group_distribution[0]+1)/2 ;
 26     }
 27     printf("%d\n",ans);
 28     return 0;
 29 }
```

n = int(input())

l = list(map(int, input().split()))
l1 = []

for i in range(n):
    l1.append((l[i]//2 +1))

if n > 3:
    k = (n // 2 + 1) // 2 + 1 #Groups which decline
else:
    k = (n // 2 + 1) // 2

for i in range(k):
    l1.remove(max(l1))

print(sum(l1))


Edited by author 15.09.2018 21:04

#include<stdio.h>
int main()
{
    int n,i,j,item[9999],a,sum=0,temp;
    scanf("%d",&n);
    for(i=0; i<n; i++)
        scanf("%d",&item[i]);

    for(j=1; j<n; j++)
        for(a=n-1; a>=j; a--)
        {
            if(item[a-1]>item[a])
            {
                temp=item[a-1];
                item[a-1]=item[a];
                item[a]=temp;

            }
        }
        for(i=0; i<((n+1)/2); i++)
        {
            sum=sum+(item[a]+1)/2;
        }
        printf("%d\n",sum);
        return 0;
}

If I divide first and then add 1 with (n or other group numbers), I get WA. But if I add 1 at first and then I divide that time i get AC.
I have seen some of the discussion, but couldn't find the logic.Can someone help me out?

Wrote on Pascal:

var
  i, j: integer;
  ms, a, b: integer;
  arrg: array of integer;
begin
  Read(ms);
  SetLength(arrg, ms);

  for i := 0 to arrg.Length - 1 do begin
    var temp: integer;
    Read(temp);
    arrg[i] := temp;
  end;

  for j := 1 to arrg.Length - 1 do
    for i := 1 to arrg.Length - j do
      if arrg[i - 1] > arrg[i] then
        Swap(arrg[i - 1], arrg[i]);

  a := arrg.Length div 2;

  for i := 0 to a do
    b := b + arrg[i] div 2 + 1;

  Write(b);
end.

Wrong answer ( test 1 ).

Прекрасно работает в IDE, а на сервере ошибка. Объясните в чем дело
import java.util.LinkedList;
import java.util.Scanner;
import static java.util.Collections.sort;

public class Bird {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int i = sc.nextInt();
        sumGol(minKol(i), toConteiner(i));
    }
    public static LinkedList<Integer> toConteiner(int i) {
        Scanner sc = new Scanner(System.in);
        String[] str = sc.nextLine().split(" ");
        LinkedList<Integer> in = new LinkedList<>();
        for (int j = 0; j < str.length; j++) in.add(Integer.parseInt(str[j]));
        return in;
    }
    public static int minKol(int i) {
        if (i % 2 != 0) i = i / 2 + 1;
        else i = i / 2;
        return i;
    }
    public static void sumGol(int i, LinkedList<Integer> l) {
        sort(l);
        int sum = 0;
        for (int j = 0; j < i; j++) {
            sum = sum + minKol(l.get(j));
        }
        System.out.print(sum);
    }
}

import java.util.Arrays;
import java.util.Scanner;


public class T1025 {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int k=sc.nextInt();
        int [] a=new int[k];
        for(int i=0;i<k;i++)
        {
            a[i]=sc.nextInt();
        }
        Arrays.sort(a);
        int vote=0;
        int mid=k%2==0?k/2:k/2+1;
        for(int i=0;i<mid;i++)
        {
            vote+=a[i]/2+1;
        }
        System.out.println(vote);

    }

}

Issue resolved, see below!

Edited by author 27.01.2015 05:49

What numbers could be in test 5?
Everything is right. Why it doesn't accepted...
Сомневаюсь, что кто-то ответит, но мало ли

why this is accepted but in the acmp wrong answer 2

461 in acmp

Edited by author 15.01.2014 14:54

#include "stdafx.h"
#include <iostream>
#include <conio.h>

using namespace std;

void bubbleSort(int array[], int col){
    int temp=0;
    for (int i=1;  i<col  ;  i++){
        for (int j=0;  j<col-i;  j++){
            if (array [j]>array [j+1]){
                temp=array[j];
                array [j]=array [j+1];
                array [j+1]=temp;
            }
        }
    }
}


int _tmain(int argc, _TCHAR* argv[])
{
    int k;
    int max;
    int sum;
    sum = 0;
    max = 0;
    cin >> k;
    int *p = new int[k-1];
    int i;
    for (i = 0; i < k; i++) {
        cin >> p[i];
    }

    bubbleSort(p, k-1);

    k=k/2+1;
    for (i=0; i<k; i++) {
    sum = sum + p[i]/2+1;
    }
    cout << sum;
    _getch();
        return 0;
}


kgxvh8-ov2fjo
kgxvh8-ov2fjo(1) : fatal error C1083: Cannot open include file: 'stdafx.h': No such file or directory
What's wrong? There is no problem in Visual Studio 12 :(

[code deleted]

Edited by moderator 20.11.2019 00:02

What is wrong in my code? Please, give me a hint.

var
   k,i,min,max,voices,sum:integer;
   ka:array [1..101] of integer;
begin
     readln(k);
     for i:= 1 to k do
     begin
          read(ka[i]);
          if i=1 then
          begin
               min:=ka[i];
               max:=ka[i];
          end
          else
          begin
               if ka[i]<min then min:=ka[i];
               if ka[i]>max then max:=ka[i];
          end;
     end;

     if min<>max then
     begin
          for i:=1 to k do
          begin
               if ka[i]=min then
               sum:=sum+ka[i];
          end;
          voices:=sum div 2 +1;
     end
     else
     begin
          for i:=1 to k do
          sum:=sum+ka[i];

          voices:=sum div 2 +1;
     end;

     writeln(voices);
end.