2WA80分求解

#include<bits/stdc++.h>
using namespace std;
long long n,a[5001],y,m,d,h,M,y2,m2,d2,h2,M2,f,f2,ans,day[13]={0,31,59,90,120,151,181,212,243,273,304,334,365};
bool Year(int year){
	if(year%100!=0&&year%4==0) return true;
	if(year%400==0) return true;
	else return false;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;++i) cin>>a[i];
	sort(a+1,a+n+1);
	scanf("%d-%d-%d-%d:%d",&y,&m,&d,&h,&M);
	scanf("%d-%d-%d-%d:%d",&y2,&m2,&d2,&h2,&M2);
	for(int i=0;i<y;++i){
		if(Year(i)==true) f+=366;
		else f+=365;
	}
	if(Year(y)==true&&m>=2) f+=day[m]+1;
	else f+=day[m];
	f+=d;
	f*=24;
	f+=h;
	f*=60;
	f+=M;
	for(int i=0;i<y2;++i){
		if(Year(i)==true) f2+=366;
		else f2+=365;
	}
	if(Year(y2)==true&&m2>=2) f2+=day[m2]+1;
	else f2+=day[m2];
	f2+=d2;
	f2*=24;
	f2+=h2;
	f2*=60;
	f2+=M2;
	f2=f2-f;
	for(int i=1;i<=n;++i){
		if(f2>=a[i]){
			ans++;
			f2-=a[i];
		} 
		else break;
	}
	cout<<ans<<endl;
	return 0;
}