Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //problema nr.2 OLI 13.02
- #include <iostream>
- #include <fstream>
- #include <vector>
- #include <algorithm>
- #include <utility>
- using namespace std;
- ifstream f("schi.in");
- ofstream g("schi.out");
- vector<pair<float, float>>v;
- //.first pt timp, .second pt pozitie
- int main()
- {
- short n, m;
- float x, lider;
- f>>n>>m>>x;
- v.resize(n+1);
- short i, j;
- v[1].first=lider=x;
- v[1].second=1;
- for (i=2; i<=n; ++i)
- {
- f>>x;
- if(x>0)
- v[i].first=lider+x;
- else
- {
- lider+=x;
- v[i].first=lider;
- }
- v[i].second=i;
- }
- sort(v.begin(),v.end());
- v.resize(m+1);
- for (i=1; i<=m/2; ++i)
- swap(v[i],v[m-i+1]);
- f>>x;
- v[1].first=x;
- lider=v[1].first;
- for (i=2; i<=m; ++i)
- {
- f>>x;
- if (x>0)
- v[i].first=lider+x;
- else
- {
- lider+=x;
- v[i].first=lider;
- }
- }
- sort(v.begin(),v.end());
- for (i=1; i<=3; ++i)
- g<<v[i].second<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement