Pagini recente » Cod sursa (job #1186847) | Cod sursa (job #2528432) | Cod sursa (job #2847674) | Cod sursa (job #2491054) | Cod sursa (job #3238374)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m, x, y, d[50002];
vector<int> v[50002];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
d[y]++;
v[x].push_back(y);
}
queue<int> q;
for(int i=1;i<=n;i++)
if(d[i]==0)
q.push(i);
for(int k=1;k<=n;k++)
{
int j=q.front();
for(auto i: v[j])
{
d[i]--;
if(d[i]==0)
{
q.push(i);
}
}
cout<<j<<" ";
q.pop();
}
}