CCCS3.cpp

#include <iostream>
#include <vector>
#include <climits>
using namespace std;

int JasonMax(vector<int>& a){
    int max = -1;
    for(int i = 0; i < a.size(); i++){
        if (a[i] > max){
        max = a[i];
        }
    }
    return max;
}
int JasonMin(vector<int>& a){
    int min = 10*10*10*10*10*10*10*10*10+1;
    for(int i = 0; i < a.size(); i++){
        if (a[i] < min){
            min = a[i];
        }

    }
    return min;
}
int main(){
    int N, M, Q;
    cin >> N >> M >> Q;
    vector<int> firstMax(M,0);
    vector<int> secondMax(M,0);

   
    for (int i = 0; i < N; i++){
        int pen, pretty;
        cin >> pen >> pretty;
        if (pretty > firstMax[pen-1]){
            int temp = firstMax[pen-1];
            firstMax[pen-1] = pretty;
            if(secondMax[pen-1] < temp){
                secondMax[pen-1] = temp;
            }
        }else if(pretty > secondMax[pen-1]){
            secondMax[pen-1] = pretty;
        }
        }
    int ans = 0;
    for (int i = 0; i < firstMax.size(); i++){
        ans += firstMax[i];
    }
    
    vector<int> min_index;
    int min = 10*10*10*10*10*10*10*10*10+1;

    for(int i = 0; i < firstMax.size(); i++){
        if (firstMax[i] < min){
            min_index.clear();
            min = firstMax[i];
            min_index.push_back(i);
        }
        if(firstMax[i] == min){
            min_index.push_back(i);
        }
    }
    int max = -1;
    for(int i = 0; i < min_index.size(); i++){
        secondMax[min_index[i]] = min;
        int t = JasonMax(secondMax);
        if(t > max){
            max = t;
        }
    }
    
    if (min < max){
        ans -= min;
        ans += max;
    }
    cout << ans;
    
    }