URAL/1025

来自"NOCOW"

VAR
  a:array [1..100] of longint;
  i,k,n:longint;
Procedure Qsort(low,high:longint);
VAR
  i,j,t,mid:longint;
BEGIN
  i:=low;
  j:=high;
  mid:=a[(low+high) div 2];
    repeat
      while a[i]<mid do inc(i);
      while a[j]>mid do dec(j);
        if i<=j then
          BEGIN
            t:=a[i];
            a[i]:=a[j];
            a[j]:=t;
            inc(i);
            dec(j);
          END;
    until i>j;
    if low<j then Qsort(low,j);
    if i<high then Qsort(i,high);
END;
BEGIN
  readln(n);
    for i:=1 to n do read(a[i]);
  Qsort(1,n);
  n:=n div 2+1;
    for i:=1 to n do inc(k,a[i] div 2+1);
  writeln(k);
END.

(来自田田)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int k,i,sum=0,temp;
    cin>>k;   
    vector<int>vec;
    for(i=0; i<k; i++)
       { cin>>temp;vec.push_back(temp); }
 
    sort(vec.begin(),vec.end());
    for(i=0; i<=k/2; i++)
      sum+=(vec[i]+1)/2;
 
    cout<<sum<<endl;  
 
    system("pause");
    return 0;
}