OJ Board

Code: Select all

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
  long long int data;
  struct node *next; 
}root;

main()
{
  int i,flag,count;
  root *list; root *firstNode; root *insertNode; root *head;
  i=1;
  list=(root*)malloc(sizeof(struct node));
  head=(root*)malloc(sizeof(struct node));
  list->data=-1;
  head->data=-1;
  firstNode=(root*)malloc(sizeof(struct node));
  while(scanf("%lld",&firstNode->data)==1)
    {if(0<=firstNode->data) break;}
  printf("%lld\n",firstNode->data);
  firstNode->next=NULL;
  list->next=firstNode;
  head->next=firstNode;
  i++; 
  while(i<=10000)
  {
    flag=1; count=0;
    insertNode=(root*)malloc(sizeof(struct node));
    while(scanf("%lld",&insertNode->data)==1)
      {if(0<=insertNode->data) break;}
    insertNode->next=NULL;
    list=head;
    if(list->next!=NULL)
    {
      while(((list->next)->data)<(insertNode->data))
      {
        list=list->next;
        if(list->next==NULL)
        {
          list->next=insertNode;
          flag=0;
        }
      }
      if(flag)
      {
        insertNode->next=list->next;
        list->next=insertNode;
      }
    }
    else
      list->next=insertNode;
    list=head;
    while(count<((i+1)/2)) {list=list->next; count++;}
    if(i&0x00000001==1)
      printf("%lld\n",list->data);
    else
      printf("%lld\n",((list->data+(list->next)->data)/2));  
    i++;
  }
}

Code: Select all

Removed After AC

Code: Select all

sort(input,input+c);

Code: Select all

stable_sort(input,input+c);

Code: Select all

removed after AC..

Code: Select all

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	long long temp=0 , i=0 , Temp=0 , k=0, j, tmp=0;
	vector<long long>v;
	while(true)
	{
		cin>>temp;
		i=0;
		v.push_back(temp);
		if(v.size()==1)
			cout<<temp<<endl;
		else
		{
			sort(v.begin() , v.end());

			//for (j = 1; j < v.size(); j++) 
			//{
				//k = j;
				//while (k > 0 && v[k - 1] > v[k]) 
				//{
				//	tmp = v[k];
				//	v[k] = v[k - 1];
				//	v[k - 1] = tmp;
				//	k--;
				//}
			//}

			if(v.size()%2==0)
			{
				i=(v.size()-2)/2;
				cout<<(v[i]+v[i+1])/2<<endl;
			}
			else
			{
				i=(v.size()-1)/2;
				cout<<v[i]<<endl;
			}
		}
	}
	return 0;
}