CodeForces 39F Pacifist frogs

http://codeforces.com/problemset/problem/39/F

模拟具体看代码

#include
#include
#include
#include
using namespace std;
struct node
{
	int id;
	int name;
	int time;
}s[110];
bool cmp(node a,node b)
{
	if(a.time==b.time)
		return a.id>n>>m>>k)
	{
		for(int i=0;i>s[i].name;
			s[i].time=0;
			s[i].id=i+1;
		}
		for(int i=0;i>x;
			for(int j=0;j