Compilare: user.cpp: In function ‘int main()’: user.cpp:3:169: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;priority_queue <da,vector<da>,greater<da> >q;priority_queue <int,vector<int>,greater<int> >p;int main(){int n,m,ts,d,i;freopen("proc2.in","r",stdin);freopen("proc2.out","w",stdout);scanf("%d%d", &n, &m);for (i=1;i<=n;i++)p.push(i);for (i=1;i<=m;i++) {scanf("%d%d", &ts, &d);while (!q.empty() && q.top().first<=ts)p.push(q.top().second),q.pop();printf("%d\n", p.top());q.push(make_pair(ts+d,p.top()));p.pop();}return 0;} ^ user.cpp:3:201: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;priority_queue <da,vector<da>,greater<da> >q;priority_queue <int,vector<int>,greater<int> >p;int main(){int n,m,ts,d,i;freopen("proc2.in","r",stdin);freopen("proc2.out","w",stdout);scanf("%d%d", &n, &m);for (i=1;i<=n;i++)p.push(i);for (i=1;i<=m;i++) {scanf("%d%d", &ts, &d);while (!q.empty() && q.top().first<=ts)p.push(q.top().second),q.pop();printf("%d\n", p.top());q.push(make_pair(ts+d,p.top()));p.pop();}return 0;} ^ user.cpp:3:223: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;priority_queue <da,vector<da>,greater<da> >q;priority_queue <int,vector<int>,greater<int> >p;int main(){int n,m,ts,d,i;freopen("proc2.in","r",stdin);freopen("proc2.out","w",stdout);scanf("%d%d", &n, &m);for (i=1;i<=n;i++)p.push(i);for (i=1;i<=m;i++) {scanf("%d%d", &ts, &d);while (!q.empty() && q.top().first<=ts)p.push(q.top().second),q.pop();printf("%d\n", p.top());q.push(make_pair(ts+d,p.top()));p.pop();}return 0;} ^ user.cpp:3:294: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;priority_queue <da,vector<da>,greater<da> >q;priority_queue <int,vector<int>,greater<int> >p;int main(){int n,m,ts,d,i;freopen("proc2.in","r",stdin);freopen("proc2.out","w",stdout);scanf("%d%d", &n, &m);for (i=1;i<=n;i++)p.push(i);for (i=1;i<=m;i++) {scanf("%d%d", &ts, &d);while (!q.empty() && q.top().first<=ts)p.push(q.top().second),q.pop();printf("%d\n", p.top());q.push(make_pair(ts+d,p.top()));p.pop();}return 0;} ^