POJ 3253 Fence Repair

#include<cstdio>
using namespace std;


const int N = 50005;
int heap[N],len;


void push(int x)
{
int i;
i = ++len;
while (i > 1)
{
if (heap[i / 2] <= x) break;


heap[i] = heap[i / 2];
i /= 2;
}
heap[i] = x;


return;
}


int pop()
{
int x, ans, i,j;
ans = heap[1];
x = heap[len--];
i = 1;
j = 2;
while (j <= len)
{
if (j+1 <= len && heap[j] > heap[j + 1])  j++;
if (heap[j] >= x) break;
heap[i] = heap[j];
i = j;
j = i * 2;
}
heap[i] = x;


return ans;
}


int main()
{
int n, m, k;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &m);
push(m);
}
int l1, l2;
long long sum;
sum = 0;


while (len > 1)
{
l1 = pop();
l2 = pop();
sum = sum + l1 + l2;
push(l1 + l2);
}
printf("%lld\n", sum);
    return 0;
}

    POJ  3253

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.

FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.

Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.

Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the Nplanks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.

#include<cstdio>
using namespace std;


const int N = 50005;
int heap[N],len;


void push(int x)
{
int i;
i = ++len;
while (i > 1)
{
if (heap[i / 2] <= x) break;


heap[i] = heap[i / 2];
i /= 2;
}
heap[i] = x;


return;
}


int pop()
{
int x, ans, i,j;
ans = heap[1];
x = heap[len--];
i = 1;
j = 2;
while (j <= len)
{
if (j+1 <= len && heap[j] > heap[j + 1])  j++;
if (heap[j] >= x) break;
heap[i] = heap[j];
i = j;
j = i * 2;
}
heap[i] = x;


return ans;
}


int main()
{
int n, m, k;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &m);
push(m);
}
int l1, l2;
long long sum;
sum = 0;


while (len > 1)
{
l1 = pop();
l2 = pop();
sum = sum + l1 + l2;
push(l1 + l2);
}
printf("%lld\n", sum);
    return 0;
}

自己写的堆，，

用优先队列就比较简单。。

 

但是  greater  在vs2017中 要用  #include <functional>  这个函数库，，，

//#include "stdafx.h"
//#include <functional>
#include<queue>
#include<cstdio>
using namespace std;
typedef long long ll;
int main()
{
ll sum;
int ll, rr, n, m;
sum = 0;
scanf_s("%d", &n);
priority_queue<int, vector<int>, greater<int> >que;    //这是一个取出为小的优先队列。。。
for (int i = 0; i < n; i++)
{
scanf_s("%d", &m);
que.push(m);
}
while (que.size()>1)
{
ll = que.top();
que.pop();
rr = que.top();
que.pop();
sum = sum + ll + rr;
que.push(ll + rr);
}
printf("%lld", sum);


return 0;
}