浙江大学PAT乙级(1095)题解(C++)

#include 
#include 
#include 
#include 
using namespace std;
struct node{
    string key;
    int value;
};
bool cmp(const node &a,const node &b){
    return a.value != b.value ? a.value > b.value : a.key < b.key;
}
int main() {
    int N,M;
    cin>>N>>M;
    string A[N];
    int B[N];
    int C[M];
    string D[M];
    for(int i=0;i>A[i]>>B[i];
    }
    for(int i=0;i>C[i]>>D[i];
    }
    vector  Q(N);
    for(int i =1;i<=M;i++){
        printf("Case %d: %d %s\n",i,C[i-1],D[i-1].c_str());
        if(C[i-1]==1){
            vector temp;
            for(int j =0;j map;
            vector love;
            for(int j=0;j