1095 Cars on Campus (30)

#include
using namespace std;
const int MAXN=100001;
int n,k;
struct Node{
	string ID;
	int time;
	int sign;
	Node(){
		sign=-1;
		time=-1;
	}
};
bool cmp(Node a,Node b){
	if(a.ID!=b.ID) return a.ID ppp;
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
	#endif
	cin>>n>>k;
	ppp.resize(n);
	for(int i=0;i>temp1;
		ppp[i].ID=temp1;
		scanf("%d:%d:%d",&h,&m,&s);cin>>status;
		int t=h*3600+m*60+s;
		ppp[i].time=t;
		ppp[i].sign=(status=="in"?1:-1);
	}
	sort(ppp.begin(),ppp.end(),cmp);
	vector qqq;
	for(int i=0;i tt;
	int maxtime=0;
	for(int i=0;i::iterator it=tt.begin();
	vector vv;
	while(it!=tt.end()){
		if(it->second>maxtime){
			maxtime=it->second;
			vv.clear();
			vv.push_back(it->first);
		}else if(it->second==maxtime){
			vv.push_back(it->first);
		}
		it++;
	}
	sort(qqq.begin(),qqq.end(),cmp1);
	for(int i=0;i

此题22分飘过,两个段错误待解决

你可能感兴趣的:(C++/PAT/洛谷OJ)