Source Code
#include <cstring>
#include <vector>
#include <stdio.h>
#include <bitset>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include<sstream>
#include <iomanip>
#include <vector>
#include<utility>
#include <iostream>
#define ll long long
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n,m; cin >> n>>m;
	vector<ll>v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	ll ctr = v[0];
	for (int i = 1; i < m; i++) {
		if (v[i] == v[i-1]) {
			ctr++;
		}
		else {
			ctr = v[i];
		}
	}
	cout << ctr << "\n";
}
Copy
Cutting Trees makamkh899
GNU G++17
26 ms
1.0 MB
Wrong Answer