백준 정렬 모음집 - 2

백준 11557번 - Bronze I

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
bool compare(pair<string, int>a, pair<string, int>b){
    return a.second>b.second;
}
int main(void) {
    pair<string, int>uni;
    vector<pair<string,int>>vc;

    int tc;
    cin>>tc;
    for(int i=0;i<tc;i++){
        int n;
        cin>>n;
        for(int j=0;j<n;j++){
            cin>>uni.first>>uni.second;
            vc.push_back(uni);
        }
        sort(vc.begin(), vc.end(),compare);
        cout <<vc[0].first<<"\n";
    }


}

 

 

백준 5576번 - Bronze II

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(void) {
    int wuni[10],kuni[10];
    for(int i=0;i<10;i++){
        cin>>wuni[i];
    }
    sort(wuni,wuni+10);
    for(int i=0;i<10;i++){
        cin>>kuni[i];
    }
    sort(kuni, kuni+10);

    cout << wuni[7]+wuni[8]+wuni[9]<<" "<<kuni[7]+kuni[8]+kuni[9]<<endl;
}

 

백준 9076번 - Bronze II

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(void) {
    int sum=0;
    int tc;
    cin>>tc;
    int n[5];
    for(int i=0;i<tc;i++){
        for(int i=0;i<5;i++){
            cin>>n[i];
            sum+=n[i]; // 총합
        }
        sort(n,n+5); //정렬
    
        if(n[3]-n[1]>=4){
            cout <<"KIN"<<endl;
        }else{
            sum-=(n[0]+n[4]);
            cout <<sum<<endl;
            
        }
        sum=0;
    }

}

 

백준 10610번 - Silver V

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(void) {
    //30의 배수 1. 마지막 숫자 0, 2. 각 자리수 합이 3의 배수
    
    string s;
    cin>>s;
    sort(s.begin(),s.end(),greater<char>());
    if(s[s.length()-1]!='0'){ // 맨 끝이 0이 아니면
        cout <<-1;
    }else{
        int sum=0;
        for(int i=0;i<s.length();i++){
            sum+=s[i]-'0';
        }
        if(sum%3==0){
            cout <<s;
        }else{
            cout <<-1;
        }
    }
    cout <<"\n";
}