题解 | #牛牛的平面向量#

#include<iostream>
using namespace std;
class point{
private:
    int x;
    int y;
public:
    point() {}
    point(int x,int y):x(x),y(y){}
    void setpoint(int x,int y)
    {
        this->x = x;
        this->y = y;
    }
    point operator +(point &c)
    {
        point temp;
        temp.x = x + c.x;
        temp.y = y + c.y;
        return temp;
    }
    void display()
    {
        cout<<x<<" "<<y<<endl;
    }
};
int main()
{
    int n;
    cin>>n;
    point p1[n];
    point p2(0,0);
    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        p1[i].setpoint(x,y);
        p2 = p2 + p1[i];
    }
    p2.display();
    return 0;
}