2点WA,求调qwq
  • 板块P1167 刷题
  • 楼主2013wjy
  • 当前回复3
  • 已保存回复3
  • 发布时间2025/7/26 09:36
  • 上次更新2025/7/26 15:06:35
查看原帖
2点WA,求调qwq
1059277
2013wjy楼主2025/7/26 09:36
#include<bits/stdc++.h>
#define long long int
using namespace std;
int n;
int y,m,d,h;
int yy,mm,dd,hh,ans,a[10000];
char c;
int e[13]={0,31,59,90,120,151,181,212,243,273,304,334,365},f[13]={0,31,60,91,121,152,182,213,244,274,305,335,366};
int MM,M,t,tt,cnt;
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+1+n);
	cin>>yy>>c>>mm>>c>>dd>>c>>hh>>c>>MM;
	cin>>y>>c>>m>>c>>d>>c>>h>>c>>M;
	for(int i=yy;i<y;i++){
		if((i%4==0&&i%100)||(i%400==0)){
			t+=366;
		}else{
			t+=365;
		}
	}
	ans+=(t*24*60);
	t=0;
	if((y%4==0&&y%100)||(y%400==0)){
		t=((f[m])*24*60);
	}else{
		t=((e[m])*24*60);
	}
	if((yy%4==0&&yy%100)||(yy%400==0)){
		tt=((f[mm])*24*60);
	}else{
		tt=((e[mm])*24*60);
	}
	ans+=(t-tt);
	ans+=((d-dd)*24*60);
	ans+=((h-hh)*60);
	ans+=(M-MM);
	for(int i=1;i<=n;i++){
		if(ans>=a[i]){
            cnt++;
            ans-=a[i];
        }else{
          break;  
        } 
	}
	cout<<cnt;
	return 0;
}
2025/7/26 09:36
加载中...