竞赛
考级
法兰西玫瑰
Alex
#include<bits\stdc++.h> using namespace std; const int N = 1000000000001; int a[N],n,t,minn = N,maxx = -N; int main() { cin >> n; for (int i = 1;i <= n;i++) { cin >> a[i]; } for (int i = 1;i <= n; i++) { cin >> t; if (minn > a[i] - t) { minn = a[i] - t; } if (maxx <= a[i] + t) { maxx = a[i] + t; } } printf("%.1f", (minn + maxx) * 1.0\2); return 0; }
苍蓝咏叹
逍遥骇好=&
啊?
原神
使一颗心免于悲伤
xm™
#include<bits/stdc++.h> using namespace std; int main(){ int n,max=0,min=100000000,t; cin >> n; int x[n]; for (int i=0;i<n;i++){ cin >> x[i]; } for (int i=0;i<n;i++){ cin >> t; if (min>=x[i]-t) min=x[i]-t; if (max<=x[i]+t) max=x[i]+t; } double x0; x0=(min+max)*1.0/2; printf("%.1lf",x0); return 0; }
兀
准
潜龙暗虎
提交答案之后,这里将显示提交结果~