using namespace std; #define MAXN 111111 #define LL long long struct node { int id, deg, s; }sta[MAXN]; queue<node> que; int main() { int n; scanf("%d",&n); LL sum = 0;
for(int i = 0 ; i < n ; i++) { sta[i].id = i; scanf("%d %d",&sta[i].deg, &sta[i].s); if(sta[i].deg == 1) que.push(sta[i]); sum += (LL)sta[i].deg; } printf("%d\n",sum/2); while(!que.empty()) { node tem = que.front(); que.pop();