zoukankan      html  css  js  c++  java
  • HDU 6015 Skip the Class

    Skip the Class

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 401    Accepted Submission(s): 235


    Problem Description
    Finally term begins. luras loves school so much as she could skip the class happily again.(wtf?)

    Luras will take n lessons in sequence(in another word, to have a chance to skip xDDDD).

    For every lesson, it has its own type and value to skip.

    But the only thing to note here is that luras can't skip the same type lesson more than twice.

    Which means if she have escaped the class type twice, she has to take all other lessons of this type.

    Now please answer the highest value luras can earn if she choose in the best way.
     

    Input
    The first line is an integer T which indicates the case number.

    And as for each case, the first line is an integer n which indicates the number of lessons luras will take in sequence.

    Then there are n lines, for each line, there is a string consists of letters from 'a' to 'z' which is within the length of 10,
    and there is also an integer which is the value of this lesson.

    The string indicates the lesson type and the same string stands for the same lesson type.

    It is guaranteed that——

    T is about 1000

    For 100% cases, 1 <= n <= 100,1 <= |s| <= 10, 1 <= v <= 1000
     

    Output
    As for each case, you need to output a single line.
    there should be 1 integer in the line which represents the highest value luras can earn if she choose in the best way.
     

    Sample Input
    2 5 english 1 english 2 english 3 math 10 cook 100 2 a 1 a 2
     

    Sample Output
    115 3
    水题:
    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    #include <map>
    #include <string>
    #include <vector>
    
    using namespace std;
    map<string,int> m;
    string s;
    int value;
    int n;
    vector<int> v[105];
    int main()
    {
        int t;
        scanf("%d",&t);
        int ans=0;
        while(t--)
        {
            scanf("%d",&n);
            int cot=0;
            ans=0;
            m.clear();
            for(int i=1;i<=n;i++)
                v[i].clear();
            for(int i=1;i<=n;i++)
            {
                cin>>s>>value;
                if(!m[s]) m[s]=++cot;
                v[m[s]].push_back(value);
            }
            for(int i=1;i<=cot;i++)
                sort(v[i].begin(),v[i].end());
            for(int i=1;i<=cot;i++)
            {
                int l=v[i].size()-1;
                ans+=v[i][l];
                if(l>=1)
                ans+=v[i][l-1];
            }
            printf("%d
    ",ans);
        }
        return 0;
    }



     
  • 相关阅读:
    2017《Java技术》预备作业 计科1501 杨欣蕊
    Java技术预备作业02杨欣蕊
    系统无法从光盘启动
    动态数组ArrayList的使用
    dbgrid数据显示和数据源不同
    异步任务判断服务器是否开启
    Java字符串格式化
    思科2960 监听端口设置
    64位win7安装jdk和eclipse
    Delphi临界区的使用
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228557.html
Copyright © 2011-2022 走看看