단순 자동 문제 판정 시스템의 실현 (part1)

#include 
#include 
#include 
using std::cin;
using std::cout;
using std::endl;
using std::sort;
class vector{
private:
    int size;
    int number;
    int * data;
public:
    vector(int size){
        this->size=size;
        number=0;
        data=new int[size];
    }
    vector(vector &v){
        size=v.size;
        number=v.number;
        data=new int[size];
        for (int i = 0; i >input;
        v2.insert(input);
    }
    v2.show();
    v1.show();
    v2.sort_array();
    v2.show();
    return 0;
}

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int case_test();
//int mem_test();
int main(){
    cout<0){//parent process
        int status;
        pid_t w_result=waitpid(p1,&status,0);
        if(w_result==-1){
            perror("Failed to wait");
            exit(1);
        }
        pid_t p2=fork();
        if(p2==0){//child process
            int fd_null=open("/dev/null",O_RDWR);
            dup2(fd_null,STDOUT_FILENO);
            execlp("diff","diff","your_vector.txt","your_vector_solution.txt");
            perror("Execlp diff failed");
            exit(1);
        }
        else if(p2>0){
            int status2;
            waitpid(p2,&status2,0);
            if(WIFEXITED(status2)){
                if(WEXITSTATUS(status2)!=0){
                    cout<