백준 10708번: 크리스마스 파티

https://www.acmicpc.net/problem/10708

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n, m; cin >> n >> m;
 
    vector<int> target(m);
    for (int i=0; i<m; i++) {
        cin >> target[i];
    }
 
    vector<int> player(n);
    for (int i=0; i<m; i++) {
        int point = target[i];
 
        int cand = 0;
        for (int j=0; j<n; j++) {
            int d; cin >> d;
            if (d == point) {
                player[j]++;
            } else {
                cand++;
            }
        }
        player[point-1] += cand;
    }
 
    for (int i=0; i<n; i++) {
        cout << player[i] << CENDL;
    }
    return 0;
}