Submission #1131238

#TimeUsernameProblemLanguageResultExecution timeMemory
1131238jpfr12Table Tennis (info1cup20_tabletennis)C++20
0 / 100
16 ms836 KiB
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long int ull;
using namespace std;
const ll MOD = (ll)1e9+7;
int MAXN = 1e6;

//classes


//global
int N, K;
vector<int> vec;


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("hps.in");
  //ofstream fout("hps.out");
  //stop
  cin >> N >> K;
  vec.assign(N+1, 0);
  for(int& i: vec) cin >> i;
  sort(vec.begin(), vec.end());
  vector<int> ans;
  int left = 0;
  for(int right = 1; right < N+K; right++){
    if(vec[right] != vec[right-1]+1) left = right;
    if(right-left+1 == N){
      for(int i = left; i <= right; i++){
        cout << vec[i] << " ";
      }
      cout << '\n';
      return 0;
    }
  }
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...