网易解救小易

xiaoxiao2021-02-27  364

#include<bits/stdc++.h> using namespace std; struct Point{ int x; int y; }P[1010]; int fab(int n){ if(n<0)return -n; return n; } int main() { int n; while(cin>>n) { int i,j; int x,y; for(i=0;i<n;i++) { cin>>x; P[i].x=x; } for(i=0;i<n;i++) { cin>>y; P[i].y=y; } int min=999999999; for(i=0;i<n;i++) { if(min>fab(P[i].x-1)+fab(P[i].y-1)) min=fab(P[i].x-1)+fab(P[i].y-1); } cout<<min<<endl; } return 0; }
转载请注明原文地址: https://www.6miu.com/read-6148.html

最新回复(0)