#include #include // url #define rep(i,a,b) for(int i=a;i=a;i--) #define all(x) (x).begin(),(x).end() #define pb(x) push_back(x); templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b; const ll mod=998244353; // using mint = static_modint<1000000007>; //const ll mod=1e9+7; int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1}; const string zton="0123456789"; const string atoz="abcdefghijklmnopqrstuvwxyz"; const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const ll inf=(1ll<<60); // const int inf=(1<<30); lld dist(lld x1,lld x2,lld y1,lld y2){ lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2); res=sqrt(abs(res)); return res; } lld arg(lld x,lld y){ const lld eps=1e-8; lld res=0; if(abs(x)+abs(y)<=eps)return 0.0; else if(abs(x)<=eps){ if(y>=0.0)return (M_PI/2); else return (M_PI/2+M_PI); } else if(abs(y)<=eps){ if(x>=0.0)return 0.0; else return M_PI; } res=atan2(abs(y),abs(x)); if(x<=0&&y>=0)res=(M_PI-res); else if(x<=0&&y<=0)res+=(M_PI); else if(x>=0&&y<=0)res=(M_PI*2-res); return res; } ll gcd(ll a,ll b){ if(a==0||b==0)return a+b; ll r; r=a%b; if(r==0){ return b; } else{ return gcd(b,r); } } std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } __int128 parse128(string &s) { __int128 ret = 0; for (int i = 0; i < s.length(); i++){ if ('0' <= s[i] && s[i] <= '9'){ ret = 10 * ret + s[i] - '0'; } } return ret; } using l3 = __int128; typedef pair P; int main(void){ ios::sync_with_stdio(false); cin.tie(nullptr); int N,M;cin >> N >> M; int cnt_in[N],cnt_out[N]; fill(cnt_in,cnt_in+N,0); fill(cnt_out,cnt_out+N,0); dsu uf(N); rep(i,0,M){ int a,b;cin >> a >> b; a--;b--; cnt_in[a]++; cnt_out[b]++; uf.merge(a,b); } int zero=0; int pl=0; int gr=0; for(vector v:uf.groups()){ if(v.size()==1)continue; int d=0; for(int i:v){ if(cnt_in[i]>cnt_out[i])d+=(cnt_in[i]-cnt_out[i]); } if(d==0)zero++; else if(d>0){ pl+=d; gr++; } } int ans; if(zero>pl){ ans=(zero-1)*2; } else{ ans=pl-1; } if(ans<0)ans=0; cout << ans << endl; }