2376.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<cmath>

using namespace std;


int main()
{
   // freopen("in.txt","r",stdin);
    int N;
    scanf("%d",&N);
    while(N--)
    {
        int total,num;
        scanf("%d %d",&total,&num);
        vector< int > left(num,0);
        vector< double > right(num,0);
        for(int i = 0;i < num;i++)
        {
            scanf("%d",&left[i]); 
            right[i] = abs(total/2.0-left[i]);
        } 
        sort(left.begin(),left.end());
        sort(right.begin(),right.end());
        
        printf("%.0lf ",total/2.0-right[0]);
        
        if(left[num-1] > total-left[0]) printf("%d\n",left[num-1]);
        else printf("%d\n",total-left[0]);
       
     }    

}