静坐观雨

摘要： #include#includeusing namespace std;const int maxn = 20 + 5;struct Hero { int hp; int dps;}hero[maxn];int cmp(Hero a, Hero b){ return a.hp * b.dps >n){ int sum = 0; for(int i=0; i>hero[i].dps >> hero[i].hp ; sum += hero[i].dps ; } sort(hero, hero + n, cmp); int ans = 0; for(int i=0; i< 阅读全文