poj2442

最新推荐文章于 2018-08-14 16:39:00 发布

zhengnanlee

最新推荐文章于 2018-08-14 16:39:00 发布

阅读量1.2k

点赞数 1

分类专栏：数据结构文章标签： ACM题解报告数据结构

本文链接：https://blog.youkuaiyun.com/zhengnanlee/article/details/17303631

版权

数据结构专栏收录该内容

13 篇文章

订阅专栏

基本的堆的应用，STL中heap即可搞定。最近手速快了好多啊~

#include<algorithm>
#include<iostream>

using namespace std;
#define MAXN 2008

int a[MAXN], b[MAXN], sum[MAXN];
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int m, n;
        cin >> m >> n;
        for (int i = 0; i < n; i++)
            cin >> a[i];
        for (int i = 1; i < m; i++)
        {
            sort(a, a + n);
            for (int j = 0; j < n; j++)
                cin >> b[j];
            sort(b, b + n);
            for (int j = 0; j < n; j++)
                sum[j] = a[j] + b[0];
            make_heap(sum, sum + n);
            for (int j = 1; j < n; j++)
            {
                for (int k = 0; k < n; k++)
                {
                    int temp = a[k] + b[j];
                    if (temp >= sum[0])
                        break;
                    pop_heap(sum, sum + n);
                    sum[n - 1] = temp;
                    push_heap(sum, sum + n);
                }
            }
            for (int j = 0; j < n; j++)
                a[j] = sum[j];
        }
        sort(a, a + n);
        for (int j = 0; j < n - 1; j++)
            cout  << a[j]<< " ";
        cout << a[n-1] << endl;
    }
}