try this

3
1
2
2

What is test #19?

here is my code. In my computer he got AC on test#1. But in timus that got WA#1

var
 a:array[0..500010] of longint;

procedure sort(l,r:longint);
var
 i,j,p,x:longint;
begin randomize;
 i:=l; j:=r; x:=a[random(r-l+1)+l];
 repeat
  while x>a[i] do inc(i);
  while x<a[j] do dec(j);
  if i<=j then
   begin
    p:=a[i];a[i]:=a[j];a[j]:=p;
    inc(i); dec(j);
   end;
 until i>j;
 if i<r then sort(i,r);
 if l<j then sort(l,j);
end;

var
 p,j,k,n,i,temp,have:longint;
begin
 readln(n);
 for i:=1 to n do
  readln(a[i]);
 sort(1,n);
 temp:=-1;
 for i:=1 to n do
  begin
   if a[i]=temp then begin inc(have); continue; end;
   if n mod 2=1 then k:=1 else k:=0;
   if have>=n div 2+k then begin writeln(temp); halt; end;
   have:=1;temp:=a[i];
  end;
 if n=1 then writeln(temp);
end.

Edited by author 02.05.2011 23:00

var
max,ll,o,i,j,l,m,n:longint;
k:real;
b,a:array[1..1000] of real;
begin
readln(n);
for i:=1 to n do
begin
read(k);
j:=j+1;
a[j]:=trunc(k);
end;
J:=0;
repeat
j:=j+1;
for i:=1 to n do
if a[j]=a[i] then  l:=l+1;
o:=o+1; b[o]:=l;
l:=0;
until j=n;
max:=trunc(b[1]);
ll:=1;
for i:=1 to o do
if b[i]>max then begin max:=trunc(b[i]);ll:=i; end;

write(a[ll]);
end.

Did anyone make it to the time limit using Python 3.3?

Why WA?

#include <iostream>
using namespace std;
void main(){
    int x;
    int y;
    int jb = 0, jc = 0;
        cin >> x;
        //int mass[x];
        int *mass = new int[x];
        int *mass2 = new int[x];
        int *mass3 = new int[x];

        for(int i=0;i<x;i++){
            cin >> y;
            mass[i] = y;
        }

        for(int i=0, j=0, p=0;i<x;i++, j=0, p=0){
            if(mass[i] == 0){
                continue;
            }
            for(;j<x;j++){
                if(mass[j] == 0){
                continue;
            }
                if(mass[i]==mass[j]){
                    p++;
                    if(i!=j){
                    mass[j]=0;
                    }
                }
            }
            mass2[i] = p;
            mass3[i] = mass[i];
            if(jb<=mass2[i]){
                jb=mass2[i];
                jc=i;
            }
        }
        cout << mass3[jc];
}

AND JAVA How make this program faster?
import java.util.*;

public class Uno {
    public static void main(String[] args){
        int jb = 0, jc = 0;
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();
        int[] mass = new int[x];
        int[] mass2 = new int[x];
        int[] mass3 = new int[x];

        for(int i=0;i<mass.length;i++){
            int y = in.nextInt();
            mass[i] = y;
        }

        for(int i=0, j=0, p=0;i<mass.length;i++, j=0, p=0){
            if(mass[i] == 0){
                continue;
            }
            for(;j<mass.length;j++){
                if(mass[j] == 0){
                    continue;
                }
                if(mass[i]==mass[j]){
                    p++;
                    if(i!=j){
                    mass[j]=0;
                    }
                }
            }
            mass2[i] = p;
            mass3[i] = mass[i];
            if(jb<=mass2[i]){
                jb=mass2[i];
                jc=i;
            }
        }
        System.out.print(mass3[jc]);
    }
}

OR C#
using System;

public class Uno
{
    public static void Main(String[] args)
    {
        string x; string y;
        int jb = 0, jc = 0;
        x = Console.ReadLine();
        int[] mass = new int[int.Parse(x)];
        int[] mass2 = new int[int.Parse(x)];
        int[] mass3 = new int[int.Parse(x)];

        for (int i = 0; i < int.Parse(x); i++)
        {
            y = Console.ReadLine();
            mass[i] = int.Parse(y);
        }

        for (int i = 0, j = 0, p = 0; i < int.Parse(x); i++, j = 0, p = 0)
        {
            if (mass[i] == 0)
            {
                continue;
            }
            for (; j < int.Parse(x); j++)
            {
                if (mass[j] == 0)
                {
                    continue;
                }
                if (mass[i] == mass[j])
                {
                    p++;
                    if (i != j)
                    {
                        mass[j] = 0;
                    }
                }
            }
            mass2[i] = p;
            mass3[i] = mass[i];
            if (jb <= mass2[i])
            {
                jb = mass2[i];
                jc = i;
            }
        }
        Console.Write(mass3[jc]);
    }
}

This is my code:


program num_1510;
type ar = array of longint;
var N,i,j,c,a:longint;
arr,arr2,arr3:ar; pow:boolean;
BEGIN
    read(N);
    setlength(arr,N+2);
    setlength(arr2,N+2);
    setlength(arr3,N+2);
    for i:=1 to N do
        read(arr[i]);
    arr2[1]:=arr[1];
    c:=1;
    for i:=1 to N do
        begin
            for j:=1 to N do
                begin
                    if arr2[j]=arr[i]
                        then
                            begin
                                pow:=false;
                                break;
                            end
                        else
                            begin
                                pow:=true;
                            end;
                end;
            if pow then begin arr2[c]:=arr[i]; c:=c+1; end;
        end;
    for i:=1 to N do
        begin
            for j:=1 to N do
                begin
                    if arr[i]=arr2[j] then c:=j;
                end;
            arr3[c]:=arr3[c]+1;
        end;
    a:=arr3[1];
    for i:=1 to N do
        begin
            if a>arr3[i+1]
            then a:=a
            else a:=arr3[i+1];
        end;
    for i:=1 to N do
        begin
            if a = arr3[i]
            then begin a:=i; break; end;
        end;
    write(arr2[a]);
END.



Please, help me:)

Edited by author 01.11.2012 00:53

I get access violation when i use array of size N = 500000.

Edited by author 15.06.2010 15:54

uses std::nth_element

Try

4
0 0 0 0

Answer: 0

so if you encounter this remember to add one sentence to avoid being trapped by a series of already-sorted numbers

Add this test, please
45
1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 0 0 0 0 4 0 0 0 0 5 0 0 0 0 6 0 0 0 0 7 0 0 0 0 8 0 0 0 0 9
Good answer
0
But some greedy algorythms answer
1
P.S. Sorry for my english(

I used q_sort and have time limit 15?
And I used stl sort and got AC.
Decides it is problem with Q_sort?

program order;
var n,ap,i,j:longint;
    x:array[1..10000] of real;
    begin
    readln(n);
    for i:=1 to n do
    readln(x[i]);
    i:=1;
    while i<=n do begin
    ap:=1;
    for j:=i+1 to n do
    if x[i]=x[j] then ap:=ap+1;
    if ap>(n div 2) then begin writeln(x[i]:0:0);
                         break;
                         end
              else i:=i+1;
              end;
              end.

What is there in this test?
This solution now gets WA38

var
 ar : array[1..10,0..9] of longint;
 n,i,a1,a,j,max : longint;
begin
readln(n);
for j := 1 to n do
 begin
  readln(a);
  i := 1;
  while a <> 0 do
   begin
    a1 := a mod 10;
    a := a div 10;
    inc(ar[i,a1]);
    inc(i);
   end;
 end;
n := 0;
for i := 10 downto 1 do
 begin
  max := 0;
  for j := 1 to 9 do
   if ar[i,j] > ar[i,max] then
    max := j;
  n := n*10 + max;
 end;
writeln(n);
end.

this is my solutioon please help me!


#include <iostream>
#include <stdio.h>
using namespace std;
long a[50001], sum=0;
void merge(long,long,long);
void merge_sort(long low,long high)
{
 long mid;
 if(low<high)
 {
  mid=(low+high)/2;
  merge_sort(low,mid);
  merge_sort(mid+1,high);
  merge(low,mid,high);
 }
}
void merge(long low,long mid,long high)
{
 long h,i,j,b[50001],k;
 h=low;
 i=low;
 j=mid+1;
 while((h<=mid)&&(j<=high))
 {
  if(a[h]<=a[j])
  {
   b[i]=a[h];
   h++;
  }
  else
  {
   b[i]=a[j]; sum+=mid-h+1;
   j++;
  }
  i++;
 }
 if(h>mid)
 {
  for(k=j;k<=high;k++)
  {
   b[i]=a[k];
   i++;
  }
 }
 else
 {
  for(k=h;k<=mid;k++)
  {
   b[i]=a[k];
   i++;
  }
 }
 for(k=low;k<=high;k++) a[k]=b[k];
}

int main(){

 long num,i,a[50001];;
 cin>>num;
 for(i=1;i<=num;i++)
 {
  cin>>a[i] ;
 }if(num==1)cout<<a[1];
 else{
 merge_sort(1,num);
 cout<<a[num/2];
}return 0;}