Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will cras

这是自己关于poj3669写的一部分的代码，一直出错，然后就不想写了。不知道自己哪里错了

#include<stdio.h>

#include<iostream>

#include<algorithm>

#include<cstring>

using namespace std;

int Map[305][305]={0}, m;

int dx[5]={0, 0, 0, 1, -1};

int dy[5]={0, 1, -1, 0, 0};

int time[305][305];

void f(int x, int y, int t);

struct zuo

{

int x, y;

int t;

}a[50005];

bool cmp(zuo a, zuo b)

{

return a.t>b.t;

}

int main()

{

int a1, a2, a3;

int i, j;

cin>>m;

for(i=0; i<m; i++)

cin>>a[i].x>>a[i].y>>a[i].t;

sort(a, a+m, cmp);

for(i=0; i<m; i++)

{

a1 = a[i].x; a2 = a[i].y; a3 = a[i].t;

f(a1, a2, a3);

}

int maxx = a[0].x;

int maxy = a[0].y;

for(i=1; i<m; i++)

{

if(maxx <= a[i].x) maxx = a[i].x;

if(maxy <= a[i].y) maxy = a[i].y;

}

int maxxy = max(maxx, maxy);

for(i=0; i<m; i++)

cout<<a[i].x<<"\t"<<a[i].y<<"\t"<<a[i].t<<endl;

cout<<maxx<<"\t"<<maxy<<"\t"<<maxxy<<endl;

}

void f(int x, int y, int t)

{

int i;

for(i=0; i<5; i++)

{

Map[x+dx[i]][y+dy[i]] = 1;

time[x+dx[i]][y+dy[i]] = t;

}

}