提出 #53570

---

ソースコード 拡げる

#include <iostream>
#include <sstream>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <string.h>
#include <stdio.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;


int n,m,k;
int num[100010];
vector<int> relate[100010];

int main()
{
	cin>>n>>m>>k;
	memset(num,0,sizeof(num));

	for (int i = 0; i < m; i++)
	{
		char type;
		int p1,p2;
		cin>>type;

		if (type=='t')
		{
			cin>>p1;
			num[p1]++;
			for (int j = 0; j < relate[p1].size(); j++) num[relate[p1][j]]++;
		}
		if (type=='f')
		{
			cin>>p1>>p2;
			relate[p1].push_back(p2);
			relate[p2].push_back(p1);
		}
		if (type=='u')
		{
			cin>>p1>>p2;
			vector<int>::iterator end_it = remove( relate[p1].begin(), relate[p1].end(), p2 );
			relate[p1].erase( end_it, relate[p1].end() );
			end_it = remove( relate[p2].begin(), relate[p2].end(), p1 );
			relate[p2].erase( end_it, relate[p2].end() );
		}
	}

	sort(num,num+(n+1));
	cout<<num[n-k+1]<<endl;

	return 0;
}

提出情報

ジャッジ結果