๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

๐Ÿ“ ์•Œ๊ณ ๋ฆฌ์ฆ˜/Programmers

[C++/PGS] Lv.0 : ๋“ฑ์ˆ˜ ๋งค๊ธฐ๊ธฐ

728x90

 

https://school.programmers.co.kr/learn/courses/30/lessons/120882#

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

SW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก, ์ฑ„์šฉ๊นŒ์ง€ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„

programmers.co.kr

 

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๋“ฑ์ˆ˜ ๋งค๊ธฐ๊ธฐ ๋ฌธ์ œ

 

ํ‰๊ท  ์—ฐ์‚ฐ ๊ณผ์ •์—์„œ ๋‚˜๋ˆ—์…ˆ์ด ๋“ค์–ด๊ฐ€๋Š”๋ฐ

์†Œ์ˆซ์ ๊นŒ์ง€ ๋ณด๊ณ  ์ˆœ์œ„๋ฅผ ๊ตฌํ•ด์•ผ ํ•ด์„œ

int ๋Œ€์‹  double๋กœ ํ‰๊ท ์„ ๊ตฌํ•ด์•ผ ํ•œ๋‹ค!!!

 

 

๋‚˜์˜ ํ’€์ด

#include <string>
#include <vector>
#include <map>
#include <iostream>
#include <algorithm>
using namespace std;

vector<int> solution(vector<vector<int>> score) {
    vector<int> answer;
    vector<double> avg; 
    vector<double> sorted_avg; 
    
    for(int i=0; i<score.size(); ++i){
        double fi = score[i][0];
        double se = score[i][1];
        double a = (fi+se)/2;
        avg.push_back(a);
        sorted_avg.push_back(a);
    }
    sort(sorted_avg.begin(), sorted_avg.end(),greater<double>());
    
    for(int i=0; i<avg.size(); ++i){
        for(int j=0; j<avg.size(); ++j){
            if(avg[i] == sorted_avg[j]) {
                answer.push_back(j+1);
                break;
            }
        }
    }
    return answer;
}

 

728x90