2、赶去公司--网易2017春招

 1 #include <iostream>
 2 #include <cmath>
 3 using namespace std;
 4 struct Point
 5 {
 6     int x;
 7     int y;
 8     int dis0;
 9     int dis1;
10     int sum;
11 };
12 int main()
13 {
14     int n;
15     while(cin>>n)
16     {
17         Point p[n+1];
18         for(int i=0;i<n;i++)
19         {
20             cin>>p[i].x;
21         }
22         for(int i=0;i<n;i++)
23         {
24             cin>>p[i].y;
25         }
26         cin>>p[n].x>>p[n].y;
27         int walktime;
28         int taxitime;
29         int min;
30         int walk;
31         cin>>walktime>>taxitime;
32         for(int i=0;i<n;i++)
33         {
34            p[i].dis0 = abs(p[i].x) + abs(p[i].y);
35            p[i].dis1 = abs(p[n].x - p[i].x) + abs(p[n].y - p[i].y);
36            p[i].sum = p[i].dis0 * walktime + p[i].dis1 * taxitime;
37         }
38         walk = abs(p[n].x) + abs(p[n].y);
39         min = walk*walktime;
40         for(int i=0;i<n;i++)
41         {
42             if(p[i].sum < min)
43                 min = p[i].sum;
44         }
45         cout<<min<<endl;
46     }
47     return 0;
48 }