Codeforces Beta Round #2 A. Winner

http://codeforces.com/contest/2/problem/A

Ideal: Give you some people's results

Seeking the name of the people who have the greatest achievement

If there are many outputs, the first to be up> = RET && End> = RET

ACcode:

#include<bits/stdc++.h>
using namespace std;
string name[1000100];
int score[1000100];
int main()
{
    int n;
    scanf("%d", &n);
    map<string, int>m;
    m.clear();
    int ret = -1e9;
    for(int i = 1; i <= n; i++)
    {
        cin >> name[i] >> score[i];
        m[name[i]] += score[i];
    }
    for(int i = 1; i <= n; i++)
        ret = max(ret, m[name[i]]);
    map<string, int>c;
    c.clear();
    for(int i = 1; i <= n; i++)
    {
        c[name[i]] += score[i];
        if(m[name[i]] >= ret && c[name[i]] >= ret)
        {
            cout << name[i] << endl;
            break;
        }
    }
    return 0;
}

Intelligent Recommendation

Codeforces Beta Round 77 (Div. 2 Only)

layout: post title: Codeforces Beta Round 77 (Div. 2 Only) author: "luowentaoaa" catalog: true tags: mathjax: true - codeforces Portal A - Football (Sign) The meaning of problems Q. Is there...

Codeforces Beta Round 84 (Div. 2 Only)

layout: post title: Codeforces Beta Round 84 (Div. 2 Only) author: "luowentaoaa" catalog: true tags: mathjax: true - codeforces Portal have to say this ancient field too simple A - Nearly Lu...

Codeforces Beta Round #75 (Div. 2)---A. Chips

Chips time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n walruses sitting in a circle. All of them are numbered in the ...

Codeforces Beta Round #14 (Div. 2)A. Letter

A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with n rows and m columns. Bob shaded some of the squares on the sheet. Having seen his masterpi...

Codeforces Beta Round #69 (Div. 2 Only)

A - Panoramix’s Prediction Is b the first prime number greater than a B-Depression simulation C - Heroes Because there are three enemies, we use the ternary method to enumerate all situations. T...