栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 2497 Strategies

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 2497 Strategies

#include<algorithm>#include<cstdlib>#include<iostream>#include<string>#include<cstring>#include<cmath>#include<cstdio>using namespace std;bool cmp(int a,int b){     return a > b;}int main(){    int t;    int time,n;    int dif1[25],dif2[25];    int t1,n1,t2,n2,sum1,sum2;    scanf("%d",&t);    for(int ca = 1; ca <= t; ca++){      int i,j;      scanf("%d%d",&time,&n);      for(i = 0; i < n; i++){        scanf("%d",&dif1[i]);        dif2[i] = dif1[i];      }      sort(dif1,dif1+n);      sort(dif2,dif2+n,cmp);      //for(i = 0; i < n; i++) printf(" %d ",dif1[i]);      //for(i = 0; i < n; i++) printf(" %d ",dif2[i]);      sum1 = sum2 = 0;      i = 0;      t1 = 0;      while(i < n && t1 <= time) { t1 += dif1[i]; sum1 += t1; i++;}      if(t1 > time){ i--; sum1 -= t1;      }      t2 = 0;      j = 0;      while(j < n && t2 <= time) { t2 += dif2[j]; sum2 += t2; j++;}      if(t2 > time){ j--; sum2 -= t2;      }      if(i == j){        if(sum1 > sum2) printf("Scenario #%d:nLinus wins with %d solved problems and a score of %d.nn",ca,j,sum2);        else printf("Scenario #%d:nSteve wins with %d solved problems and a score of %d.nn",ca,i,sum1);      }      else if(i > j) printf("Scenario #%d:nSteve wins with %d solved problems and a score of %d.nn",ca,i,sum1);      else printf("Scenario #%d:nLinus wins with %d solved problems and a score of %d.nn",ca,j,sum2);    }    return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/375863.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号