Submission

[-SSSS][-SSSS]

Score: 0

User: Nagornz

Problemset: จุดแวะพัก

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-13 21:07:16

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n, k; cin >> n >> k;
    vector <pair <int, string>> a;
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        bool found = false;
        int cnt = 0;
        int num;
        while (cin >> num) {
            if (num == k) found = true;
            if (!found) cnt++;
        }
        if (found) a.emb(cnt, s);
    }
    sort(all(a));
    for (auto [x, s] : a) cout << s << " ";
}