70分代码：

#include<bits/stdc++.h>
using namespace std;
int a[13]={0,0,31,60,91,121,152,182,213,244,274,305,335};
int n,y,r;
int s[1005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>y>>r;
		s[i]+=a[y];
		s[i]+=r;
	}
	sort(s+1,s+1+n);
	s[n+1]=367;
	int t;
	double k;
	for(int i=1;i<=n+1;i++){
		t=max(t,s[i]-s[i-1]-1);
	}
	k=(t*1.0*86400/366)+0.5;
	t=k;
	cout<<t;
	return 0;
}

70分链接

AC代码：

#include<bits/stdc++.h>
using namespace std;
int a[13]={0,0,31,60,91,121,152,182,213,244,274,305,335};
int n,y,r,s[1005],t;
double k;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>y>>r;
		s[i]+=a[y];
		s[i]+=r;
	}
	sort(s+1,s+1+n);
	s[n+1]=367;
	for(int i=1;i<=n+1;i++){
		t=max(t,s[i]-s[i-1]-1);
	}
	k=(t*1.0*86400/366)+0.5;
	t=k;
	cout<<t;
	return 0;
}

AC记录