pku1968.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <algorithm>
#define ONLINE
#define size 3100
#ifndef ONLINE
#include <time.h>
#endif

using namespace std;

typedef struct Node
{
	int index;
	int page;
}Node;

bool cmp(const Node &a, const Node &b)
{
	return a.page < b.page;
}

Node v[size];

int main()
{

#ifndef ONLINE
	freopen("PKU1968.in", "r", stdin);
	clock_t start = clock();
#endif
	
	int Sn, ID, Bn, Low, i, Hn;
	int ans, minid;
	while (EOF != scanf("%d", &Sn))
	{
		scanf("%d %d", &ID, &Bn);
		for (i = 0; i < Bn; i++)
		{
			scanf("%d", &v[i].page);
			v[i].index = i;
		}
		sort(v, v + Bn, cmp);
		Low = Bn / Sn;
		Hn = Bn - Low * Sn;
		minid = size;
		if (ID < Hn)
		{
			for (i = (Low + 1) * ID; i < (Low + 1) * (ID + 1); i++)
			{
				if (v[i].index < minid)
				{
					minid = v[i].index;
					ans = v[i].page;
				}
			}
		}
		else
		{
			for (i = (Low + 1) * Hn + Low * (ID - Hn); i < (Low + 1) * Hn + Low * (ID - Hn + 1); i++)
			{
				if (v[i].index < minid)
				{
					minid = v[i].index;
					ans = v[i].page;
				}
			}
		}
		printf("%d\n", ans);
	}

#ifndef ONLINE
	printf("TIME:%dms\n", clock() - start);
#endif
	return 0;
}