15th ZJP Acm- Pro L. Doki Doki Literature Club

Please note that each word can be used at most once!

Input
There are multiple test cases. The first line of input contains an integer TT$T$ (about 100), indicating the number of test cases. For each test case:

The first line contains two integers n n $n$ and mm$m$ ( 1≤m≤n≤100 1 ≤ m ≤ n ≤ 100 $1 \le m \le n \le 100$), indicating the number of words and the length of the poem.

For the following n n $n$ lines, the ii$i$-th line contains a string consisting of lowercased English letters wi w i $w_i$ ( 1≤|wi|≤15 1 ≤ | w i | ≤ 15 $1 \le |w_i| \le 15$) and an integer f(wi) f ( w i ) $f(w_i)$ ( −109≤f(wi)≤109 − 10 9 ≤ f ( w i ) ≤ 10 9 $-10^9 \le f(w_i) \le 10^9$), indicating the i i $i$-th word and Sayori’s preference to this word. It’s guaranteed that wi≠wjwi≠wj$w_i \ne w_j$ for all i≠j i ≠ j $i \ne j$.

Output
For each test case output one line containing an integer H H $H$ and mm$m$ strings s1,s2,…,sm s 1 , s 2 , … , s m $s_1, s_2, \dots, s_m$ separated by one space, indicating the maximum possible happiness and the corresponding poem. If there are multiple poems which can achieve the maximum happiness, print the lexicographically smallest one.

Please, DO NOT output extra spaces at the end of each line, or your answer may be considered incorrect!

A sequence of m m $m$ strings a1,a2,…,ama1,a2,…,am$a_1, a_2, \dots, a_m$ is lexicographically smaller than another sequence of m m $m$ strings b1,b2,…,bmb1,b2,…,bm$b_1, b_2, \dots, b_m$, if there exists a k k $k$ (1≤k≤m1≤k≤m$1 \le k \le m$) such that ai=bi a i = b i $a_i = b_i$ for all 1≤i<k 1 ≤ i < k $1 \le i < k$ and ak a k $a_k$ is lexicographically smaller than bk b k $b_k$.

A string s1=a1a2…ax s 1 = a 1 a 2 … a x $s_1 = a_1a_2\dots a_x$ is lexicographically smaller than another string s2=b1b2…by s 2 = b 1 b 2 … b y $s_2 = b_1b_2\dots b_y$, if there exists a k k $k$ (1≤k≤min(x,y)1≤k≤min(x,y)$1 \le k \le \min(x, y)$) such that ai=bi a i = b i $a_i = b_i$ for all 1≤i<k 1 ≤ i < k $1 \le i < k$ and ak<bk a k < b k $a_k < b_k$, or ai=bi a i = b i $a_i = b_i$ for all 1≤i≤min(x,y) 1 ≤ i ≤ min ( x , y ) $1 \le i \le \min(x, y)$ and x<y x < y $x < y$.

题目传送门

/*
* Doki Doki Literature Club
* 这题就是废话多，就两句话有用，最后注意下爆int的子项
*/

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
#define len 102
struct data{
    string _s;
    int key;
}map[102];

int cmp(data _a,data _b)
{

    if( _a.key == _b.key)   return _a._s < _b._s;   // 比赛的时候抽了 自己重写了 '<'
    return _a.key > _b.key ;
}

int main()
{
    int n,m;
    int test;
    //模版可忽略
    static_cast<void>(ios::sync_with_stdio(false)),cin.tie(0);

    cin>>test;

    while(test--)
    {
        cin>>n>>m;
        long long ans = 0;
        for(int i=1;i<=n;++i)
        {
            cin>>map[i]._s>>map[i].key;
        }

        sort(map+1, map+n+1, cmp);

        for (long i =1; i<=m; ++i) {
            ans += (m-i+1)*map[i].key;
        }

        cout<<ans;

        for(int i=1;i<=m;++i)
        {
            cout<<" "<< map[i]._s ;
        }
        cout<<endl;
    }
    return 0;
}

Created By LosReturn.

本文标签： ACMZJPproClubLiterature