CodeForces 408A

最新推荐文章于 2021-02-08 22:54:18 发布

ChangeCore

最新推荐文章于 2021-02-08 22:54:18 发布

阅读量440

点赞数

分类专栏：切记熟能生巧啊

本文链接：https://blog.csdn.net/ChangeCore/article/details/29897953

版权

切记熟能生巧啊专栏收录该内容

8 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define INF 2000000000
int Min,n,nasce,sum,num;
int People[110];
int main()
{
    while(scanf("%d",&nasce) != EOF)
    {
        Min = INF;
        for(int i = 1; i <= nasce; i++)
            scanf("%d",&People[i]);
        for(int i = 1; i <= nasce; i++)
        {
            sum = 0;
            for(int j = 1; j <= People[i]; j++)
            {
                scanf("%d",&num);
                sum += (num * 5);
            }
            sum += People[i] * 15;
            Min = min(sum,Min);
        }
        printf("%d\n",Min);
    }
    return 0;
}