Submission #9420733

---

Source Code Expand

#include <iostream>  // cin,cout
#include <stdio.h>   // printf,scanf (standard input/output)
#include <cmath>     // abs(x),pow(x,2)
#include <string>
#include <string.h>  // strlen, strcmp
#include <algorithm> // min,max, sort(v.begin(),v.end())
#include <vector>
#include <time.h>
using namespace std;

struct Data{
    int A;
    string S;
    
    bool operator<( const Data& right ) const {
        return A == right.A ? S < right.S : A < right.A;
        //return A < right.A;
    }
};

int Func(){
    int x = 0;
    return x;
}

int main(){
    int N;
    string S[60];
    int t[60];
    string X;
    
    // 入力
    cin >> N;
    for (int i=0;i<N;i++) cin >> S[i] >> t[i];
    cin >> X;

    int count = 0;
    int flag = 0;
    for (int i=0;i<N;i++) {
        if (flag) {
            count += t[i];
        }
        if (S[i]==X) {
            flag = 1;
        }
    }
    
    cout << count << endl;
    

    
    return 0;
}

Submission Info

Judge Result