Pagini recente » Cod sursa (job #2038251) | Cod sursa (job #1869155) | Cod sursa (job #1523354) | Cod sursa (job #1180689) | Cod sursa (job #3249928)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
//#include <bits/stdc++.h>
#define in fin
#define out fout
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int m, n; in >> m >> n;
vector<int> bl[m + 1];
int dp[m + 1];
for(int i = 0; i <= m; i++) dp[i] = 0;
for(int i = 0; i < n; i++){
int d, l; in >> d >> l;
bl[d].push_back(l);
}
// for(int i = 0; i <= m; i++) sort(bl[i].begin(), bl[i].end());
// if(!bl[0].empty()) dp[0] = bl[0].back();
int maxi = 0;
// for(int i = 1; i <= m; i++){
// dp[i] = dp[i - 1] + 1;
// if(bl[i].size() >= 1){
// maxi = max(maxi, max(dp[i], dp[i] + bl[i].back()));
// dp[i] = max(dp[i], bl[i].back());
// }
// if(bl[i].size() >= 2){
// maxi = max(maxi, bl[i].back() + bl[i][ bl[i].size() - 2 ]);
// }
// }
// for(int i = 0; i <= m; i++){
// cout << dp[i] << " ";
// }
// cout << '\n';
out << maxi << '\n';
return 0;
}