HDU 5835 Danganronpa （贪心）

Danganronpa

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=5835

Description

Input

Output

Sample Input

Sample Output

Source

##题意：


##题解：


##代码：
``` cpp
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define LL long long
#define double long long
#define eps 1e-8
#define maxn 101000
#define mod 1000000007
#define inf 0x3f3f3f3f
#define mid(a,b) ((a+b)>>1)
#define IN freopen("in.txt","r",stdin);
using namespace std;

int main(int argc, char const *argv[])

{

//IN;

int t, ca=1; cin >> t;

while(t--)

{

    int n; scanf("%d", &n);

    int sum = 0, maxx = 0;

    for(int i=1; i<=n; i++) {

        int x; scanf("%d", &x);

        sum += x;

        maxx = max(maxx, x);

    }

    int ans = min(sum/2, (sum-maxx)*2+1);

    printf("Case #%d: %d\n", ca++, ans);

}

return 0;

}

####大小交替模拟：

``` cpp

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

using namespace std;

int a[20];

int main(int argc, char const *argv[])

{

    //freopen("in.txt", "r", stdin);

    int T;

    int n;

    scanf("%d", &T);

    int cas = 0;

    while (T--){

        scanf("%d", &n);

        int sum = 0;

        for (int i = 1; i <= n; ++i){

            scanf("%d", &a[i]);

            sum += a[i];

        }

        sort(a + 1, a + n + 1);

        int p = 1, q = n;

        int res = 0;

        while (p != q){

            int x = min(a[p], a[q]);

            res += x * 2;

            a[p] -= x;

            a[q] -= x;

            if (a[p] == 0) ++p;

            if (a[q] == 0) --q;

        }

        int ans = min(sum / 2, res);

        printf("Case #%d: %d\n", ++cas, ans);

    }

}