2018-2019 Russia Open High School Programming Contest

A. Company Merging

Solved.

温暖的签到。

 1 #include<bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 const int maxn = 2e5 + 10;
 6 
 7 typedef long long ll;
 8 
 9 struct node{
10     int val, num;
11     node(){}
12     node(int val, int num):val(val), num(num){}
13 }arr[maxn];
14 
15 int n, m;
16 
17 int main()
18 {
19     while(~scanf("%d", &n))
20     {
21         int Max = 0;
22         for(int i = 1; i <= n; ++i)
23         {
24             scanf("%d", &arr[i].num);
25             arr[i].val = 0;
26             for(int j = 1, x; j <= arr[i].num; ++j)
27             {
28                 scanf("%d", &x);
29                 arr[i].val = max(arr[i].val, x);
30             }
31             Max = max(arr[i].val, Max);
32         }
33         ll ans = 0;
34         for(int i = 1; i <= n; ++i)
35         {
36 //            cout << arr[i].val << " " << endl;
37             ans += 1ll * arr[i].num * (Max - arr[i].val);
38         }
39         printf("%lld\n", ans);
40     }
41     return 0;
42 }

View Code